By Topic

Evaluating overflow probability for voice over internet protocol buffer dimensioning

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
$31 $31
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

4 Author(s)
Amaradasa, V. ; Dept. of Electron. Eng., Queen Mary, Univ. of London, London ; Schormans, J. ; Pitts, J. ; Leung, C.M.

The provision of quality of service to different service types in broadband packet networks requires techniques for the evaluation of the probabilities of packet delays and loss. The authors analyse the multiplexing of independent and homogeneous Markovian ON-OFF traffic sources into a single buffer, extending earlier work. The resulting closed-form equation provides a virtually zero-complexity approach to the calculation of the buffer overflow probability via the burst-scale decay rate of the buffer state probabilities. Graphical results are provided, comparing our expression with the results from simulations and the -standard- formula of Anick, Mitra and Sondhi. These show that our new formula provides excellent accuracy for medium to high loads, i.e. those load values at which queuing becomes important. This makes it ideal for quick calculations, with practical utility when dimensioning checks are required in many networking situations involving the accurate estimation of loss probabilities in e.g. buffer multiplexing VoIP traffic sources.

Published in:

Communications, IET  (Volume:3 ,  Issue: 4 )