Results 1 to 2 of 2

Math Help - Prove using the inverse of the Erlang-B loss function

  1. #1
    Newbie
    Joined
    Sep 2009
    Posts
    12

    Prove using the inverse of the Erlang-B loss function

    I would like to know how to prove that:

    considering that function F is the ceil of the inverse of the Erlang-B loss function, that is, receives as input parameters the load and a particular target loss rate and its output is the upper integer of the result (the number of channels required)

    Let h denote the amount of traffic carried by one connection (for example)
    Well, I know that F(h) is always greater or equal than F((n+2)h) - F((n+1)h) for n = 0...N

    In other words, the number of channels required by the first connection is always greater or equal than the increment that it will generate if the system is already loaded by some connections.

    Does anyone knows how can I prove that mathematically ???

    Thank you very much in advance for your valuable help!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Sep 2009
    Posts
    12
    Just to let you know that F is a real-valued concave function...I think it should help
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Prove using the inverse of the Erlang-B loss function
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: May 13th 2010, 02:05 AM
  2. Replies: 1
    Last Post: April 9th 2010, 06:51 PM
  3. Replies: 5
    Last Post: January 30th 2010, 08:18 PM
  4. Prove that function is inverse of itself?
    Posted in the Pre-Calculus Forum
    Replies: 4
    Last Post: June 26th 2009, 12:02 AM
  5. Replies: 1
    Last Post: May 24th 2009, 08:47 AM

Search Tags


/mathhelpforum @mathhelpforum