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

L. Zhu; G. Cheng; N. Ansari

doi:10.1049/ip-com:20030239

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

L. Zhu, G. Cheng, N. Ansari

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	6-10
Number of pages	5
Journal	IEE Proceedings: Communications
Volume	150
Issue number	1
DOIs	https://doi.org/10.1049/ip-com:20030239
State	Published - Feb 2003

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1049/ip-com:20030239

Cite this

@article{dc6610aae693489eb5b0f9ed81f8f0e2,

title = "Delay bound of youngest serve first (YSF) aggregated packet scheduling",

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.",

author = "L. Zhu and G. Cheng and N. Ansari",

year = "2003",

month = feb,

doi = "10.1049/ip-com:20030239",

language = "English (US)",

volume = "150",

pages = "6--10",

journal = "IEE Proceedings: Communications",

issn = "1350-2425",

publisher = "Institute of Electrical Engineers",

number = "1",

}

TY - JOUR

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

AU - Zhu, L.

AU - Cheng, G.

AU - Ansari, N.

PY - 2003/2

Y1 - 2003/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0037307286

UR - https://www.scopus.com/inward/citedby.url?scp=0037307286&partnerID=8YFLogxK

U2 - 10.1049/ip-com:20030239

DO - 10.1049/ip-com:20030239

M3 - Article

AN - SCOPUS:0037307286

SN - 1350-2425

VL - 150

SP - 6

EP - 10

JO - IEE Proceedings: Communications

JF - IEE Proceedings: Communications

IS - 1

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this