Uniform weighted round robin scheduling algorithms for input queued switches

Date
2001-06
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
ICC 2001- IEEE International Conference on Communications. Conference
Print ISSN
0536-1486
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
2028 - 2032
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that provide per packet delay guarantees. Three heuristic algorithms are proposed to obtain such schedules under the constraints imposed by the unit speedup of input queued switches. Numerical experiments indicate that the algorithms have remarkable performance in finding uniform schedules.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)