Bibliographic Details
| Title: |
Sharp and simple bounds for the Erlang delay and loss formulae. |
| Authors: |
Harel, Arie1 Arie.Harel@baruch.cuny.edu |
| Source: |
Queueing Systems. Feb2010, Vol. 64 Issue 2, p119-143. 25p. 7 Charts, 3 Graphs. |
| Subjects: |
ERLANG (Computer program language), Programming languages, Convex functions, Real variables, Probability theory |
| Abstract: |
We prove some simple and sharp lower and upper bounds for the Erlang delay and loss formulae and for the number of servers that invert the Erlang delay and loss formulae. We also suggest simple and sharp approximations for the number of servers that invert the Erlang delay and loss formulae. We illustrate the importance of these bounds by using them to establish convexity proofs. We show that the probability that the M/ M/ s queue is empty is a decreasing and convex function of the traffic intensity. We also give a very short proof to show that the Erlang delay formula is convex in the traffic intensity when the number of servers is held constant. The complete proof of this classical result has never been published. We also give a very short proof to show that the Erlang delay formula is a convex function of the (positive integer) number of servers. One of our results is then used to get a sharp bound to the Flow Assignment Problem. [ABSTRACT FROM AUTHOR] |
|
Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
