Buffer Overflow Period in a MAP Queue

Chydzinski, Andrzej

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

Mathematical Problems in Engineering

On this page

Abstract References Copyright Related Articles

Research Article | Open Access

Volume 2007 | Article ID 034631 | https://doi.org/10.1155/2007/34631

Buffer Overflow Period in a MAP Queue

Andrzej Chydzinski¹

Academic Editor: Nahum Shimkin

Received27 Apr 2006

Revised23 Oct 2006

Accepted20 Nov 2006

Published08 Jan 2007

Abstract

The buffer overflow period in a queue with Markovian arrival process (MAP) and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

References

P.-T. de Boer, V. F. Nicola, and J.-K. C. W. van Ommeren, “The remaining service time upon reaching a high level in $M / G / 1$ queues,” Queueing Systems, vol. 39, no. 1, pp. 55–78, 2001.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
A. Chydzinski, “Duration of the buffer overflow period in a batch arrival queue,” Performance Evaluation, vol. 63, no. 4-5, pp. 493–508, 2006.
View at: Publisher Site | Google Scholar
A. Jean-Marie, Y. Calas, and T. Alemu, “On the compromise between burstiness and frequency of events,” Performance Evaluation, vol. 62, no. 1–4, pp. 382–399, 2005.
View at: Publisher Site | Google Scholar
G. Carle and E. Biersack, “Survey of error recovery techniques for IP-based audiovisual multicast applications,” IEEE Network, vol. 11, no. 6, pp. 24–36, 1997.
View at: Publisher Site | Google Scholar
A. Chydzinski, “On the distribution of consecutive losses in a finite capacity queue,” WSEAS Transactions on Circuits and Systems, vol. 4, no. 3, pp. 117–124, 2005.
View at: Google Scholar | MathSciNet
S. Asmussen, “Equilibrium properties of the $M / G / 1$ queue,” Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 58, no. 2, pp. 267–281, 1981.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
A. Chydzinski, “On the remaining service time upon reaching a given level in $M / G / 1$ queues,” Queueing Systems, vol. 47, no. 1-2, pp. 71–80, 2004.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
A. Pacheco and H. Ribeiro, “Consecutive customer loss probabilities in $M / G / 1 / n$ and $G I / M (m) / / n$ systems,” in Proceedings of Workshop on Tools for Solving Structured Markov Chains (SMCtools '06), Pisa, Italy, October 2006.
View at: Google Scholar
D. Fakinos, “The expected remaining service time in a single server queue,” Operations Research, vol. 30, no. 5, pp. 1014–1018, 1982.
View at: Google Scholar | Zentralblatt MATH
W. Leland, M. Taqqu, W. Willinger, and D. Wilson, “On the self-similar nature of ethernet traffic (extended version),” IEEE/ACM Transactions on Networking, vol. 2, no. 1, pp. 1–15, 1994.
View at: Publisher Site | Google Scholar
M. Crovella and A. Bestavros, “Self-similarity in world wide web traffic: evidence and possible causes,” IEEE/ACM Transactions on Networking, vol. 5, no. 6, pp. 835–846, 1997.
View at: Publisher Site | Google Scholar
T. Yoshihara, S. Kasahara, and Y. Takahashi, “Practical time-scale fitting of self-similar traffic with Markov-modulated Poisson process,” Telecommunication Systems, vol. 17, no. 1-2, pp. 185–211, 2001.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
P. Salvador, R. Valadas, and A. Pacheco, “Multiscale fitting procedure using Markov modulated Poisson processes,” Telecommunication Systems, vol. 23, no. 1-2, pp. 123–148, 2003.
View at: Google Scholar
S. H. Kang, Y. H. Kim, D. K. Sung, and B. D. Choi, “An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams,” IEEE Transactions on Communications, vol. 50, no. 4, pp. 633–642, 2002.
View at: Publisher Site | Google Scholar
S.-Q. Li and C.-L. Hwang, “On the convergence of traffic measurement and queueing analysis: a statistical-matching and queueing (SMAQ) tool,” IEEE/ACM Transactions on Networking, vol. 5, no. 1, pp. 95–110, 1997.
View at: Publisher Site | Google Scholar
A. Adas, “Traffic models in broadband networks,” IEEE Communications Magazine, vol. 35, no. 7, pp. 82–89, 1997.
View at: Publisher Site | Google Scholar
S. Shah-Heydari and T. Le-Ngoc, “MMPP models for multimedia traffic,” Telecommunication Systems, vol. 15, no. 3-4, pp. 273–293, 2000.
View at: Publisher Site | Google Scholar
T. C. Wong, J. W. Mark, and K. C. Chua, “Delay performance of voice and MMPP video traffic in a cellular wireless ATM network,” IEE Proceedings - Communications, vol. 148, no. 5, pp. 302–309, 2001.
View at: Publisher Site | Google Scholar
S. H. Kang and D. K. Sung, “Two-state MMPP modeling of ATM superposed traffic streams based on the characterization of correlated interarrival times,” in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '95), vol. 2, pp. 1422–1426, Singapore, November 1995.
View at: Publisher Site | Google Scholar
V. Ramaswami, “The $N / G / 1$ queue and its detailed analysis,” Advances in Applied Probability, vol. 12, no. 1, pp. 222–261, 1980.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
D. M. Lucantoni, “New results on the single server queue with a batch Markovian arrival process,” Communications in Statistics. Stochastic Models, vol. 7, no. 1, pp. 1–46, 1991.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
D. M. Lucantoni, G. L. Choudhury, and W. Whitt, “The transient $B M A P / G / 1$ queue,” Communications in Statistics. Stochastic Models, vol. 10, no. 1, pp. 145–182, 1994.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
D. M. Lucantoni, “Further transient analysis of the $B M A P / G / 1$ queue,” Communications in Statistics. Stochastic Models, vol. 14, no. 1-2, pp. 461–478, 1998.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
W. Fischer and K. Meier-Hellstern, “The Markov-modulated Poisson process (MMPP) cookbook,” Performance Evaluation, vol. 18, no. 2, pp. 149–171, 1993.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
A. Baiocchi and N. Blefari-Melazzi, “Steady-state analysis of the MMPP/G/1/K queue,” IEEE Transactions on Communications, vol. 41, no. 4, pp. 531–534, 1992.
View at: Publisher Site | Google Scholar
C. Blondia, “The $N / G / 1$ finite capacity queue,” Communications in Statistics: Stochastic Models, vol. 5, no. 2, pp. 273–294, 1989.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
F. N. Gouweleeuw, “Calculating the loss probability in a $B M A P / G / 1 / N + 1$ queue,” Communications in Statistics: Stochastic Models, vol. 12, no. 3, pp. 473–492, 1996.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
S. Asmussen, M. Jobmann, and H.-P. Schwefel, “Exact buffer overflow calculations for queues via martingales,” Queueing Systems, vol. 42, no. 1, pp. 63–90, 2002.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
A. Chydzinski, “Transient analysis of the MMPP/G/1/K queue,” Telecommunication Systems, vol. 32, no. 4, pp. 247–262, 2006.
View at: Publisher Site | Google Scholar
A. Chydzinski, “Time to reach buffer capacity in a $B M A P$ queue,” to appear in Stochastic Models.
View at: Google Scholar

Copyright

Copyright © 2007 Andrzej Chydzinski. 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

161

Downloads

665

Citations