Parallel switching in connection-oriented networks

Author

Anderson, James ; Baruah, Sanjoy ; Jeffay, Kevin

Author_Institution

North Carolina Univ., Chapel Hill, NC, USA

fYear

1999

fDate

1999

Firstpage

200

Lastpage

209

Abstract

Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An efficient packet scheduling algorithm that guarantees a deterministic quality of service to connections with real time constraints is proposed; this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and offers real time performance guarantees similar to those offered by earlier fair scheduling strategies, such as Weighted Fair Queueing and proportional share schemes

Keywords

multiprocessing systems; packet switching; processor scheduling; quality of service; real-time systems; Weighted Fair Queueing; connection oriented networks; deterministic quality of service; fair scheduling strategies; multiple parallel links; multiprocessor scheduling algorithms; packet scheduling algorithm; packet switching; parallel switching; proportional share schemes; real time constraints; real time performance guarantees; Asynchronous transfer mode; Bandwidth; Degradation; Intelligent networks; Job design; Packet switching; Processor scheduling; Quality of service; Scheduling algorithm; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1999. Proceedings. The 20th IEEE

Conference_Location

Phoenix, AZ

ISSN

1052-8725

Print_ISBN

0-7695-0475-2

Type

conf

DOI

10.1109/REAL.1999.818843

Filename

818843