By Topic

Packet loss process under bounded delay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jianming Liu ; School of Computer & Control, Guilin University of Electronic Technology, Guangxi, China ; Xiaohong Jiang ; Achille Pattavina

This paper analyzes the loss process distribution of a finite buffer queue. In contrast to the previous work that assumed the buffer can merely store finite number of packets, our model adopts the bounded delay policy where only the packet arrival finding its delay not exceeding a preset value is admitted into the buffer. The quantity of interest is the probability distribution of the number of lost packets within a block of n consecutive packet arrivals, which is an important measure for the design of communication networks, e.g., the forward error correction (FEC). We derive a set of recursive equations to compute the above quantity for various packet size distributions. We then focus on the influence of adding redundant packets on loss probability of message block and FEC efficiency. The impacts of bounded delay, packet size distribution and traffic load are also evaluated. We demonstrate a unique property of the finite queue with bounded delay, which is different from that of the conventional finite queue (e.g., M/G/1/K queue).

Published in:

2010 International Conference on High Performance Switching and Routing

Date of Conference:

13-16 June 2010