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

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.