SIAM Journal on Applied Mathematics · 1991 · 54 citations · 7 references
BusinessComputer ScienceComputer SystemsComputer NetworksProbability TheoryStochastic ProcessesCommunication NetworksHeavy-traffic ApproximationsNetwork Performance AnalysisQueueing NetworksQueueing SystemsQueueing TheoryAsymptotic Analysis Of QueuesAsymptotic Queueing TheoryEquilibriumHeavy Traffic TheoryMany-server Limit TheoryQueue Length Asymptotics
A model is considered in which a buffer receives messages from N independent and identical information sources that asynchronously alternate between exponentially distributed periods in the “on” and “off” states. While on, a source transmits at unit rate. The buffer depletes through an output channel with a given maximum transmission rate $c < N$. This model is useful for a data-handling switch in a computer network. Anick, Mitra, and Sondhi [Bell System Tech. J., 61 (1982), pp. 1871–1894] have derived an explicit expression for the equilibrium probability $G( x )$ that the buffer content exceeds x, which is convenient for numerical calculations for moderate values of N. In this paper, the heavy traffic case, in which N is large and the system is close to instability, is investigated. Important scalings are introduced, and a two-term asymptotic approximation to $G( x )$ is derived, with the help of function theoretic techniques. Numerical comparisons are given that show the quality of the approximation.
7
Tables of integrals, series and products
Leković Danijela R. · Nuclear Physics A · 1967 · 2.6K citations
Uniform asymptotic expansions for Weber parabolic cylinder functions of large orders
F. W. J. Olver · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1959 · 150 citations · Full text
Engineering, Mechanical Engineering, Computational Fluid Dynamics +4
A new technique for analyzing large traffic systems
Alan Weiss · Advances in Applied Probability · 1986 · 130 citations