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

Document Type

Conference Proceeding

Publication Date

2-1-2003

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.

Identifier

0037307286 (Scopus)

Publication Title

IEE Proceedings Communications

External Full Text Location

https://doi.org/10.1049/ip-com:20030239

ISSN

13502425

First Page

6

Last Page

10

Issue

1

Volume

150

This document is currently not available here.

Share

COinS