A new scalable and efficient packet scheduling method in high-speed packet switch networks

Author

Shan, Cheng

Author_Institution

Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA

fYear

2001

fDate

2001

Firstpage

16

Lastpage

20

Abstract

While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing. This paper presents a new packet scheduling method-round-robin priority queuing (RRPQ). RRPQ guarantees a per-session-based delay bound without per-flow queuing. It also avoids many other implementation complexities in fair queuing scheduling. The scalability and low implementation cost of RRPQ make it a practical solution in providing guaranteed delay bounds in high-speed networks

Keywords

delays; packet switching; queueing theory; telecommunication networks; efficient packet scheduling; fair queuing scheduling; fair scheduling methods; guaranteed worst case delay bounds; high-speed packet switch networks; low implementation cost; per-flow queuing; per-session-based delay bound; round-robin priority queuing; scalable packet scheduling; weighted fair queueing; Computer science; Costs; Delay; High-speed networks; Intelligent networks; Packet switching; Processor scheduling; Scalability; Scheduling algorithm; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Switching and Routing, 2001 IEEE Workshop on

Conference_Location

Dallas, TX

Print_ISBN

0-7803-6711-1

Type

conf

DOI

10.1109/HPSR.2001.923596

Filename

923596