Bottleneck analysis in multiclass closed queueing networks and its application

@article{Berger1999BottleneckAI,
  title={Bottleneck analysis in multiclass closed queueing networks and its application},
  author={Arthur W. Berger and Lev M. Bregman and Yaakov Kogan},
  journal={Queueing Syst.},
  year={1999},
  volume={31},
  pages={217-237}
}
Asymptotic behavior of queues is studied for large closed multi-class queueing networks consisting of one infinite server station withK classes andM processor sharing (PS) stations. A simple numerical procedure is derived that allows us to identify all bottleneck PS stations. The bottleneck station is defined asymptotically as the station where the number of customers grows proportionally to the total number of customers in the network, as the latter increases simultaneously with service rates… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
16 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Another approach to asymptotic expansions for large closed queueing networks

  • Y. Kogan
  • Oper. Res. Letters
  • 1992
1 Excerpt

Asymptotic evaluation of closed queueing networks with many stations

  • A. Birman, Y. Kogan
  • Commun. Statist. Stochastic Models
  • 1992
1 Excerpt

Random Perturbations of Dynamical Systems (Springer, New York, 1984)

  • M. Freidlin, A. Wentzell
  • 1984
1 Excerpt

The dependence of sojourn times in closed queueing networks, in: Mathematical Computer Performance and Reliability

  • F. P. Kelly
  • 1984
1 Excerpt

An Introduction to Probability

  • W. Feller
  • Theory and Its Application,
  • 1970

The dependence of sojourn times in closed queueing networks "

  • F. P. Kelly

Similar Papers

Loading similar papers…