By Topic

Delay bound of youngest serve first (YSF) aggregated packet scheduling

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

3 Author(s)
Zhu, L. ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Cheng, G. ; Ansari, N.

A simple scalable aggregated traffic scheduling scheme is proposed, called the 'youngest serve first' (YSF) algorithm. It is shown analytically that YSF can provide bounded end-to-end delay time with high link utilisation that may not be possible for the first-in first-out (FIFO) scheme.

Published in:

Communications, IEE Proceedings-  (Volume:150 ,  Issue: 1 )