Skip to main content
SpringerLink
Log in

On the Number of Losses in an MMPP Queue

  • Conference paper
Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4712))

Included in the following conference series:

Abstract

We present a comprehensive analysis of the packet loss process in a finite-buffer queue fed by the Markov-modulated Poisson process. In particular, solutions for the number of losses in (0,t], the stationary number of losses and the loss ratio are presented in closed forms. Theoretical results are illustrated via numerical examples based on an IP traffic trace file.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Salvador, P., Valadas, R., Pacheco, A.: Multiscale Fitting Procedure Using Markov Modulated Poisson Processes. Telecommunication Systems 23(1, 2), 123–148 (2003)

    Article  Google Scholar 

  2. Skelly, P., Schwartz, M., Dixit, S.: A histogram-based model for video traffic behavior in an ATM multiplexer. IEEE/ACM Trans. Netw. 1(4), 446–459 (1993)

    Article  Google Scholar 

  3. Kim, Y.H., Un, C.K.: Performance analysis of statistical multiplexing for heterogeneous bursty traffic in ATM network. IEEE Trans. Commun. 42(2-4), 745–753 (1994)

    Article  Google Scholar 

  4. Kang, S., Sung, D.: Two-state MMPP modeling of ATM superposed traffic streams based on the characterization of correlated interarrival times. In: Proc. of IEEE GLOBECOM 1995, pp. 1422–1426 (1995)

    Google Scholar 

  5. Shah-Heydari, S., Le-Ngoc, T.: MMPP models for multimedia traffic. Telecommunication Systems 15(3-4), 273–293 (2000)

    Article  MATH  Google Scholar 

  6. Yoshihara, T., Kasahara, S., Takahashi, Y.: Practical time-scale fitting of self-similar traffic with Markov-modulated Poisson process. Telecommunication Systems 17(1/2), 185–211 (2001)

    Article  MATH  Google Scholar 

  7. Ryden, T.: An EM algorithm for parameter estimation in Markov modulated Poisson processes. Comput. Stat. Data Anal. 21, 431–447 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ge, H., Harder, U., Harrison, P.G.: Parameter estimation for MMPPs using the EM algorithm. In: Proc. UKPEW (2003)

    Google Scholar 

  9. Klemm, A., Lindemann, C., Lohmann, M.: Modeling IP traffic using the batch Markovian arrival process. Performance Evaluation 54(2) (2003)

    Google Scholar 

  10. Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Stat., Stochastic Models 7(1), 1–46 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fischer, W., Meier-Hellstern, K.: The Markov-modulated Poisson process (MMPP) cookbook. Performance Evaluation 18(2), 149–171 (1992)

    Article  MathSciNet  Google Scholar 

  12. Baiocchi, A., Blefari-Melazzi, N.: Steady-state analysis of the MMPP/G/1/K queue. IEEE Trans. Commun. 41(4), 531–534 (1992)

    Article  Google Scholar 

  13. Lee, D.-S., Li, S.-Q.: Transient analysis of multi-server queues with Markov-modulated Poisson arrivals and overload control. Perform. Eval. 16(1-3), 49–66 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kulkarni, L., Li, S.-Q.: Transient behaviour of queueing systems with correlated traffic. Perform. Eval. 27&28, 117–145 (1996)

    Google Scholar 

  15. Gouweleeuw, F.N.: Calculating the loss probability in a BMAP/G/1/N + 1 queue. Commun. Stat., Stochastic Models 12(3), 473–492 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nagarajan, R., Kurose, J.F., Towsley, D.: Approximation techniques for computing packet loss infinite-buffered voice multiplexers. In: Proc. of INFOCOM 1990, pp. 947–955 (1990)

    Google Scholar 

  17. Chydzinski, A.: Time to reach buffer capacity in a BMAP queue. Stochastic Models 23, 195–209 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Abate, J., Choudhury, G.L., Whitt, W.: An introduction to numerical transform inversion and its application to probability models. In: Grassman, W. (ed.) Chapter in Computational Probability, pp. 257–323. Kluwer, Boston (2000)

    Google Scholar 

  19. Chydzinski, A.: Transient analysis of the MMPP/G/1/K queue. Telecommunication Systems 32(4), 247–262 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Silesian University of Technology, Institute of Computer Sciences, Akademicka 16, 44-100 Gliwice, Poland

    Andrzej Chydzinski, Robert Wojcicki & Grzegorz Hryn

Authors
  1. Andrzej Chydzinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Wojcicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Grzegorz Hryn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yevgeni Koucheryavy Jarmo Harju Alexander Sayenko

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chydzinski, A., Wojcicki, R., Hryn, G. (2007). On the Number of Losses in an MMPP Queue. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2007. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74833-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74833-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74832-8

  • Online ISBN: 978-3-540-74833-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation