Convexity properties of the Erlang loss formula

Convexity properties of the Erlang loss formula

0.00 Avg rating0 Votes
Article ID: iaor19911382
Country: United States
Volume: 38
Issue: 3
Start Page Number: 189
End Page Number: 195
Publication Date: May 1990
Journal: Operations Research
Authors:
Abstract:

The paper proves that the throughput of the M/G/x/x system is jointly concave in the arrival and service rates. It also shows that the fraction of customers lost in the M/G/x/x system is convex in the arrival rate, if the traffic intensity is below some ρ* and concave if the traffic intensity is greater than ρ*. For 18 or less servers, ρ* is less than one. For 19 or more servers, ρ* is between 1 and 1.5. Also, the fraction lost is convex in the service rate, but not jointly convex in the two rates. These results are useful in the optimal design of queueing systems.

Reviews

Required fields are marked *. Your email address will not be published.