Block loss reduction in ATM networks
Computer Communications
Research: Modelling frame losses in a two-hop ATM network
Computer Communications
On comparing the real and probed packet drop rates of a bottleneck router: the TCP traffic case
Computer Communications
A performance study of RSVP with proposed extensions
Computer Communications
QoS-sensitive transport of real-time MPEG video using adaptive redundancy control
Computer Communications
Minimizing the Data Transfer Time Using Multicore End-System Aware Flow Bifurcation
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 754.84 |
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