Buffer overflow in intermediate network routers is the prime cause of packet loss in wired communication networks. Packet loss is usually quantified by the packet loss ratio , the fraction of packets that are lost in a buffer. While this measure captures part of the loss performance of the buffer, we show that it is insufficient to quantify the effect of loss on user-perceived quality of service for multimedia streaming applications. In this contribution, we refine the quantification of loss in two ways. First, we focus on loss of a single flow, rather than loss in a buffer. Second, we focus on the different moments of the time and number of accepted packets between losses, rather than just the mean number of accepted packets between losses (which directly relates to the packet loss ratio). The network node is modelled as a Markov-modulated M/M/1/N-type queueing system which is sufficiently versatile to capture the arrival correlation while keeping the analysis tractable. We illustrate our approach by some numerical examples.
Packet loss ratio Packet flow Queueing system
This is a preview of subscription content, log in to check access.
Ait-Hellal O, Altman E, Jean-Marie A, Kurkova I (1999) On loss probabilities in presence of redundant packets and several traffic sources. Perform Eval 36–37:485–518CrossRefzbMATHGoogle Scholar
Alouf S, Nain P, Towsley D (2001) Inferring network characteristics via moment-based estimators. Proc INFOCOM 2001:1045–1054Google Scholar
Altman E, Jean-Marie A (1998) Loss probabilities for messages with redundant packets feeding a finite buffer. IEEE J Select Areas Commun 16(5):778–787CrossRefGoogle Scholar
Jelenković P (1999) Subexponential loss rates in a GI/GI/1 queue with applications. Queue Syst 33:91–123Google Scholar
Kim H, Schroff N (2001) Loss probability calculations and asymptotic analysis for finite buffer multiplexers. IEEE/ACM Trans Netw 9(6):755–768CrossRefGoogle Scholar
Kim C, Dudin S, Klimenok V (2009) The MAP/PH/1/N queue with flows of customers as a model for traffic control in telecommunication networks. Perform Eval 66:564–579CrossRefGoogle Scholar
Kumazoe K, Kawahara K, Takine T, Oie Y (1997) Analysis of packet loss in transport layer over ATM networks. Int J Commun Syst 10:181–192CrossRefGoogle Scholar
Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. Series on statistics and applied probability. ASA-SIAMGoogle Scholar
Lin GC, Suda T, Ishizaki F (2005) Loss probability for a finite buffer multiplexer with the M/G/∞ input process. Telecommun Syst 29(3):181–197CrossRefGoogle Scholar
Michiel H, Laevens K (1997) Teletraffic engineering in a broad-band era. Proc IEEE 85(12):2007–2033CrossRefGoogle Scholar
Nardelli PHJ, Kountouris M, Cardieri P, Latva-aho M (2014) Throughput optimization in wireless networks under stability and packet loss constraints. IEEE Trans Mob Comput 13(8):1883–1895CrossRefGoogle Scholar
Takine T, Suda T, Hasegawa T (1995) Cell loss and output process analysis of a finite-buffer discrete-time ATM queueing system with correlated arrivals. IEEE Trans Commun 43:1022–1037CrossRefGoogle Scholar
Verscheure O, Garcia X, Karlsson G, Hubaux J (1998) User-oriented QoS in packet video delivery. IEEE Netw Mag 12:12–21CrossRefGoogle Scholar