Title :
Delay bound of youngest serve first (YSF) aggregated packet scheduling
Author :
Zhu, L. ; Cheng, G. ; Ansari, N.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fDate :
2/1/2003 12:00:00 AM
Abstract :
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.
Keywords :
delays; packet switching; scheduling; telecommunication traffic; YSF algorithm; bounded end-to-end delay time; delay bound; scalable aggregated traffic scheduling scheme; youngest serve first algorithm;
Journal_Title :
Communications, IEE Proceedings-
DOI :
10.1049/ip-com:20030239
