Analysis of packet loss processes in high-speed networks

The packet loss process in a single-server queueing system with a finite buffer capacity is analyzed. The model used addresses the packet loss probabilities for packets within a block of a consecutive sequence of packets. An analytical approach is presented that yields efficient recursions for the computation of the distribution of the number of lost packets within a block of packets of fixed or variable size for several arrival models and several numbers of sessions. Numerical examples are provided to compare the distribution obtained with that obtained using the independence assumption to compute the loss probabilities of packets within a block. The results show that forward error correction schemes become less efficient due to the bursty nature of the packet loss processes; real-time traffic might be more sensitive to network congestion than was previously assumed; and the retransmission probability of ATM messages has been overestimated by the use of the independence assumption. >

[1]  Israel Cidon,et al.  A Critique of ATM from a Data Communications Perspective , 1992, J. High Speed Networks.

[2]  P. S. Richards,et al.  A congestion control framework for high-speed integrated packetized transport , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[3]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[4]  S. Halfin.  Batch delays versus customer delays , 1983, The Bell System Technical Journal.

[5]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[6]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[7]  Israel Cidon,et al.  Analysis of packet loss processes in high-speed networks , 1991, 17th Convention of Electrical and Electronics Engineers in Israel.

[8]  Gunnar Karlsson,et al.  Packet video and its integration into the network architecture , 1989, IEEE J. Sel. Areas Commun..

[9]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[10]  Gene H. Golub,et al.  Matrix computations , 1983 .

[11]  I. Miller.  Probability, Random Variables, and Stochastic Processes , 1966 .

[12]  Israel Cidon,et al.  Congestion control for high speed packet switched networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[13]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[14]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[15]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[16]  Paul E. McKenney,et al.  Packet recovery in high-speed networks using coding and buffer management , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.