Sciweavers

INFOCOM
2003
IEEE

On Guaranteed Smooth Scheduling For Input-Queued Switches

13 years 9 months ago
On Guaranteed Smooth Scheduling For Input-Queued Switches
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challenge, because the time interval for the matching computations needed for determining switch configurations becomes very small. Possible alternatives in scheduler design include increasing the scheduling interval by using envelopes [1], and using a framebased scheduler that guarantees fixed rates between input-output pairs. However, both these alternatives have significant jitter drawbacks: the jitter increases with the envelope size in the first alternative, and previously-known methods do not guarantee tight jitter bounds in the second. In this paper, we propose a hybrid approach to switch scheduling. Traffic with tight jitter constraints is first scheduled using a frame-based scheduler that achieves low jitter bounds. Jitter-insensitive traffic is later scheduled using an envelope-based scheduler. The...
Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where INFOCOM
Authors Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis
Comments (0)