Asymptotics of overflow probabilities in Jackson networks

Authors:
Jiyeon Lee
Affiliations:
Department of Statistics, Yeungnam University, Kyungsan 712-749, South Korea
Venue:
Operations Research Letters
Year:
2004

Citing 3
Cited 1

Analysis of an importance sampling estimator for tandem queues

ACM Transactions on Modeling and Computer Simulation (TOMACS)
The optimal buffer allocation problem

IEEE Transactions on Information Theory
Correctness within a constant of an optimal buffer allocation rule of thumb

IEEE Transactions on Information Theory

Call packing bound for overflow loss systems

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load.