Logarithmic Delay for $N \times N$ Packet Switches Under the Crossbar Constraint

We consider the fundamental delay bounds for scheduling packets In an N times N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs.

[1]  Saswati Sarkar.  Optimum scheduling and memory management in input queued switches with finite buffer space , 2004, IEEE Trans. Inf. Theory.

[2]  Matthew Andrews,et al.  Scheduling reserved traffic in input-queued switches: new delay bounds via probabilistic techniques , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  I. Gopal,et al.  Minimizing Packet Waiting Time in a Multibeam Satellite System , 1982, IEEE Trans. Commun..

[4]  Marco Ajmone Marsan,et al.  On the stability of input-queued switches with speed-up , 2001, TNET.

[5]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

[6]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[7]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[8]  J. M. Bilbao,et al.  Contributions to the Theory of Games , 2005 .

[9]  Nick McKeown,et al.  Maximum Size Matchings and Input Queued Switches , 2002 .

[10]  Marco Ajmone Marsan,et al.  Multicast traffic in input-queued switches: optimal scheduling and maximum throughput , 2003, TNET.

[11]  Chak-Kuen Wong,et al.  Incremental time-slot assignment in SS/TDMA satellite systems , 1991, IEEE Trans. Commun..

[12]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[13]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[14]  D.N. Serpanos,et al.  Multicast schedulers for ATM switches with multiple input queues , 2004, Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, 2004..

[15]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[17]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[18]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[21]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[22]  Nick McKeown,et al.  Matching output queueing with a combined input output queued switch , 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).

[23]  Lisa Zhang,et al.  Achieving stability in networks of input-queued switches , 2003, TNET.

[24]  Eytan Modiano,et al.  Logarithmic delay for N × N packet switches under the crossbar constraint , 2007, TNET.

[25]  David Gamarnik,et al.  Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks , 1999, STOC '99.