Skip to main content

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

Included in the following conference series:

Abstract

It is a well known fact that the packet loss ratio is an important but insufficient measure to assess the influence of packet loss on user perceived quality of service in telecommunication networks. In this paper we therefore assess other loss process characteristics of finite capacity Markov-modulated M/M/1-type buffers. Combining a probability generating functions approach with matrix techniques, we derive an expression for the joint probability generating function of the time and the number of accepted packets – packets that are not lost – between packet losses. We then illustrate our approach by means of some numerical examples.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kim, H., Schroff, N.: Loss probability calculations and asymptotic analysis for finite buffer multiplexers. IEEE/ACM Transactions on Networking 9, 755–768 (2001)

    Article  Google Scholar 

  2. Pihlsgard, M.: Loss rate asymptotics in a GI/G/1 queue with finite buffer. Stochastic Models 21, 913–931 (2005)

    Article  MathSciNet  Google Scholar 

  3. Dán, G., Fodor, V., Karlsson, G.: Analysis of the packet loss process for multimedia traffic. In: Proceedings of the 12th International Conference on Telecommunication Systems, Modeling and Analysis, Monterey, CA, pp. 83–84 (2004)

    Google Scholar 

  4. Frossard, P.: FEC performance in multimedia streaming. IEEE Communications Letters 5, 122–124 (2001)

    Article  Google Scholar 

  5. Gurewitz, O., Sidi, M., Cidon, I.: The ballot theorem strikes again: packet loss process distribution. IEEE Transactions on Information Theory 46, 2588–2595 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dube, P., Ait-Hellal, O., Altman, E.: On loss probabilities in presence of redundant packets with random drop. Performance Evaluation 52, 147–167 (2003)

    Article  MATH  Google Scholar 

  7. Cidon, I., Khamisy, A., Sidi, M.: Analysis of packet loss processes in high speed networks. IEEE Transactions on Information Theory IT-39, 98–108 (1993)

    Article  MATH  Google Scholar 

  8. Altman, E., Jean-Marie, A.: Loss probabilities for messages with redundant packets feeding a finite buffer. IEEE Journal of Selected Areas in Communications 16, 778–787 (1998)

    Article  Google Scholar 

  9. Ait-Hellal, O., Altman, E., Jean-Marie, A., Kurkova, I.: On loss probabilities in presence of redundant packets and several traffic sources. Performance Evaluation 36–37, 485–518 (1999)

    Article  MATH  Google Scholar 

  10. Sheng, H., Li, S.: Spectral analysis of packet loss rate at a statistical multiplexer for multimedia services. IEEE/ACM Transactions on Networking 2, 53–65 (1994)

    Article  Google Scholar 

  11. Schulzrinne, H., Kurose, J., Towsley, D.: Loss correlation for queues with burtsty input streams. In: Proceedings of IEEE ICC, pp. 219–224 (1992)

    Google Scholar 

  12. Latouche, G., Ramaswami, V.: Introduction to matrix analytic methods in stochastic modeling. In: ASA-SIAM, Series on statistics and applied probability (1999)

    Google Scholar 

  13. Neuts, M.: Matrix-geometric solutions in stochastic models: An algorithmic approach. Dover Publications, Mineola (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiems, D., Bruneel, H. (2006). On the Packet Loss Process at a Network Node. In: Koucheryavy, Y., Harju, J., Iversen, V.B. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2006. Lecture Notes in Computer Science, vol 4003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759355_4

Download citation

  • DOI: https://doi.org/10.1007/11759355_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34429-2

  • Online ISBN: 978-3-540-34430-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics