By Topic

Transient performance analysis of the selective drop buffer acceptance scheme with responsive traffic

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

2 Author(s)
K. Spaey ; Dept. of Math. & Comput. Sci., Antwerp Univ., Belgium ; C. Blondia

This paper considers the selective drop (SD) algorithm, a packet aware buffer acceptance algorithm used with the unspecified bit rate ATM service category. The influence of the parameters of the SD algorithm on the transient performance results (efficiency and fairness) is studied when starting from an unfair start situation. This is done using an analytical model where two responsive sources send their traffic in packets consisting of cells via a buffer on which the SD algorithm is implemented. Three different scheduling algorithms are used in combination with the SD algorithm. Based on an extensive set of numerical examples, observations are made. From these results, one of the most important conclusions is that a large improvement of the fairness results is seen when SD is implemented, irrespective of the exact setting of its parameters. On the efficiency results, these parameters have however a more important effect. So it is recommended to implement SD to increase the fairness, but with a parameter setting focussed on the efficiency results

Published in:

Computer Communications and Networks, 2001. Proceedings. Tenth International Conference on

Date of Conference: