Hierarchical shaped deficit round-robin scheduling

Author

Jiwasurat, Soranun ; Kesidis, George ; Miller, David J.

Author_Institution

Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA

Volume

2

fYear

2005

fDate

28 Nov.-2 Dec. 2005

Abstract

We describe a hierarchical traffic shaper-scheduler, hierarchical SDRR (HSDRR), for flows of variable-length packets that is low-complexity (scales with the number of queues). That is, HSDRR can be used channelize the output link of a router to satisfy service-level agreements (token bucket constraints) struck at network-to-network boundaries. HSDRR is a hybrid round-robin/time-stamp scheduler (S. Ramabhadran and J. Pasquale, 2003) that employs shaped deficit round-robin (SDRR) (S. Jiwasurat and G. Kesidis, 2004) scheduling in the first stage and shaped virtual clock (SVC) (D. Stiliadis and A. Varma, 1997) in the second and final stage.

Keywords

computer network management; scheduling; telecommunication network routing; hierarchical shaped deficit round-robin scheduling; network-to-network boundaries; service-level agreements; shaped virtual clock; time-stamp scheduler; token bucket constraints; variable-length packets; Bandwidth; Clocks; Computer science; Feeds; Internet; Processor scheduling; Scheduling algorithm; Static VAr compensators; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE

Print_ISBN

0-7803-9414-3

Type

conf

DOI

10.1109/GLOCOM.2005.1577729

Filename

1577729