Title of article
Delay bound of youngest serve first (YSF) aggregated packet scheduling
Author/Authors
N.، Ansari, نويسنده , , G.، Cheng نويسنده , , L.، Zhu, نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
-5
From page
6
To page
0
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
Distributed systems
Journal title
IEE Proceedings Communications
Serial Year
2003
Journal title
IEE Proceedings Communications
Record number
106013
Link To Document