CAM01-5: Low-Jitter Scheduling Algorithms for Deadline-Aware Packet Switches

We study low jitter-scheduler design for deadline-aware input-queued (IQ) packet switches. We consider scheduling of traffic streams associated with service profiles, which reflect the inter-packet deadlines between packets constituting the stream. To make the NP-hard problem of scheduling with strict deadlines tractable, we use soft deadlines as a modeling tool, and study the scheduling problem with soft deadlines in a dynamic programming (DP) framework. We establish the optimality of a myopic scheduling policy for the canonical 2times2 crossbar switch. For bigger switches, we develop low-complexity approximations to the myopic policy (which is near-optimal), one based on the notion of neighborhood search, and two others based on convex relaxations of an integer programming problem. We demonstrate the efficacy of the proposed policies via simulations, employing good put as a performance metric. A key feature of the proposed policies is that they do not require knowledge of traffic statistics (rate, periodicity etc.), rendering them robust and amenable to implementation.

[1]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[2]  Paolo Giaccone,et al.  Randomized scheduling algorithms for high-aggregate bandwidth switches , 2003, IEEE J. Sel. Areas Commun..

[3]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[4]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[5]  Jean C. Walrand,et al.  High-performance communication networks , 1999 .

[6]  Aditya Dua,et al.  Deadline Aware Scheduling for Input Queued Packet Switches , 2006 .

[7]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[8]  J. Liu,et al.  Scheduling Multirate Periodic Traffic in a Packet Switch , 1997 .

[9]  Nirwan Ansari,et al.  Input-queued switching with QoS guarantees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[11]  Murat Alanyali,et al.  Uniform weighted round robin scheduling algorithms for input queued switches , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[12]  Pravin Varaiya,et al.  High-performance communication networks (2nd ed.) , 1999 .

[13]  Nicholas Bambos,et al.  Local search scheduling algorithms for maximal throughput in packet switches , 2004, IEEE INFOCOM 2004.

[14]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services , 2001, IEEE Trans. Commun..

[15]  Murali S. Kodialam,et al.  On guaranteed smooth scheduling for input-queued switches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).