Delay Analysis of an <mml:math id="E1" xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math> Priority Queueing System with Push-out Scheme

Lee, Yutae; Choi, Bong Dae; Kim, Bara; Sung, Dan Keun

doi:https://doi.org/10.1155/2007/14504

Mathematical Problems in Engineering

On this page

Abstract References Copyright Related Articles

Research Article | Open Access

Volume 2007 | Article ID 014504 | https://doi.org/10.1155/2007/14504

Delay Analysis of an M/G/1/K Priority Queueing System with Push-out Scheme

Yutae Lee,¹Bong Dae Choi,²Bara Kim,²and Dan Keun Sung³

Academic Editor: Giuseppe Rega

Received16 Mar 2007

Accepted18 Oct 2007

Published06 Dec 2007

Abstract

This paper considers an M/G/1/K queueing system with push-out scheme which is one of the loss priority controls at a multiplexer in communication networks. The loss probability for the model with push-out scheme has been analyzed, but the waiting times are not available for the model. Using a set of recursive equations, this paper derives the Laplace-Stieltjes transforms (LSTs) of the waiting time and the push-out time of low-priority messages. These results are then utilized to derive the loss probability of each traffic type and the mean waiting time of high-priority messages. Finally, some numerical examples are provided.

References

H. Armbruster and G. Arndt, “broadband communication and its realization with broadband ISDN,” IEEE Communications Magazine, vol. 25, no. 11, pp. 8–19, 1987.
View at: Publisher Site | Google Scholar
H. Takagi, “Explicit delay distribution in first-come first-served M/M/m/K and M/M/m/K/n queue and a mixed loss-delay system,” in Proceedings of Asia-Pacific Symposium on Queueing Theory and Its Applications to Telecommunication Networks, Seoul, Korea, 2006.
View at: Google Scholar
Y. Kim and J. Kim, “Performance analysis of an ATM multiplexer with multiple QoS VBR traffic,” ETRI Journal, vol. 19, no. 1, pp. 12–23, 1997.
View at: Google Scholar
A. Gravey and G. Hebuterne, “Mixing time and loss priorities in a single server queue,” in Proceedings of the 13th International Teletraffic Congress (ITC '91), vol. 13, pp. 47–52, Stockholm, Sweden, June 1991.
View at: Google Scholar
A. Gravey, P. Boyer, and G. Hebuterne, “Tagging versus strict rate enforcement in ATM networks,” in IEEE Global Telecommunications Conference (GLOBECOM '91), vol. 1, pp. 271–275, Phoenix, Ariz, USA, December 1991.
View at: Google Scholar
H. Kröner, G. Hebuterne, P. Boyer, and A. Gravey, “Priority management in ATM switching nodes,” IEEE Journal on Selected Areas in Communications, vol. 9, no. 3, pp. 418–427, 1991.
View at: Publisher Site | Google Scholar
S. Kasahara, H. Takagi, Y. Takahashi, and T. Hasegawa, “ $M / G / 1 / K$ system with push-out scheme under vacation policy,” Journal of Applied Mathematics and Stochastic Analysis, vol. 9, no. 2, pp. 143–157, 1996.
View at: Publisher Site | Google Scholar | MathSciNet
K. V. Cardoso, J. F. de Rezende, and N. L. S. Fonseca, “On the effectiveness of push-out mechanisms for the discard of TCP packets,” in Proceedings of IEEE International Conference on Communications (ICC '02), vol. 4, pp. 2636–2640, New York, NY, USA, April-May 2002.
View at: Publisher Site | Google Scholar
C. G. Chang and H. H. Tan, “Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks,” in Proceedings of the 13th IEEE Networking for Global Communications, vol. 2, pp. 500–509, Toronto, Canada, June 1994.
View at: Publisher Site | Google Scholar
X. Cheng and I. F. Akyildiz, “A finite buffer two class queue with different scheduling and push-out schemes,” in Proceedings of the the 11th Annual Conference of the IEEE Computer and Communications Societies (INFOCOM '92), vol. 1, pp. 231–241, Florence, Italy, May 1992.
View at: Google Scholar
L. Gui and C. Fan, “Analysis of a priority cell discarding method for ATM networks,” Telecommunication Systems, vol. 4, no. 1, pp. 51–60, 1995.
View at: Publisher Site | Google Scholar
G. Hebuterne and A. Gravey, “Space priority queuing mechanism for multiplexing ATM channels,” Computer Networks and ISDN Systems, vol. 20, no. 1–5, pp. 37–43, 1990.
View at: Google Scholar
D. P. Heyman, “The push-out priority queue discipline,” Operations Research, vol. 33, no. 2, pp. 397–403, 1985.
View at: Google Scholar
H. Saito, “Queueing analysis of cell loss probability control in ATM networks,” in Proceedings of the 13th International Teletraffic Congress (ITC '91), vol. 13, pp. 19–24, Stockholm, Sweden, June 1991.
View at: Google Scholar
G.-L. Wu and J. W. Mark, “A buffer allocation scheme for ATM networks: complete sharing based on virtual partition,” IEEE/ACM Transactions on Networking, vol. 3, no. 6, pp. 660–670, 1995.
View at: Publisher Site | Google Scholar
H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation. Vol. 2. Finite Systems, North-Holland, Amsterdam, The Netherlands, 1991.
L. Kleinrock, Queueing Systems, Volume 1: Theory, John Wiley & Sons, New York, NY, USA, 1975.
L. Kleinrock, Queueing Systems, Volume 2: Computer Applications, John Wiley & Sons, New York, NY, USA, 1976.

Copyright

Copyright © 2007 Yutae Lee et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation Order printed copies

Views

390

Downloads

974

Citations