By Topic

Local flow separation

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

1 Author(s)
Liberatore, V. ; Div. of Comput. Sci., Case Western Reserve Univ., Cleveland, OH, USA

This paper elaborates on a paradigm for quality-of-service (QoS) that is local, i.e., it does not depend on multinode cooperation. In order to maintain short queuing delays, we individuate flows that occupy a large fraction of a buffer and segregate those flows into a separate queue. The algorithm is provably fair and can avoid all packet reorderings. We show through extensive simulations that state requirements are minimal, and that other flows will benefit from short queuing delays while aggressive flows can still maintain high throughput.

Published in:

Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on

Date of Conference:

7-9 June 2004