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

L. Zhu, G. Cheng, Nirwan Ansari

Research output: Contribution to journalArticlepeer-review

Abstract

A scalable aggregated traffic scheduling scheme was proposed known as the youngest serve first (YSF) algorithm. YSF provided bounded end-to-end delay time with high link utilisation which was not possible for the first-in-first out (FIFO) scheme. A label value was used to indicate the packet state and was encoded in a certain field in each packet header.

Original languageEnglish (US)
Pages (from-to)6-10
Number of pages5
JournalIEE Proceedings: Communications
Volume150
Issue number1
DOIs
StatePublished - Feb 1 2003

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Delay bound of youngest serve first (YSF) aggregated packet scheduling'. Together they form a unique fingerprint.

Cite this