Logarithmic delay for N × N packet switches under the crossbar constraint

We consider the fundamental delay bounds for scheduling packets in an N × 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 leastO(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]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

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

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

[4]  A. Kolen.  Combinatorial optimization algorithm and complexity: Prentice-Hall, Englewood Cliffs, 1982, 496 pages, $49.50 , 1983 .

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

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

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

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

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

[10]  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).

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

[12]  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).

[13]  Lisa Zhang,et al.  Achieving stability in networks of input-queued switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  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).

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

[16]  Eytan Modiano,et al.  Delay and Complexity Tradeoffs for Dynamic Routing and Power Allocation in a Wireless Network , 2002 .

[17]  Eytan Modiano,et al.  Tradeoffs in Delay Guarantees and Computation Complexity for Packet Switches NN , 2002 .

[18]  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.

[19]  Cheng-Shang Chang,et al.  Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches , 2006, IEEE/ACM Transactions on Networking.

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

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

[22]  Matthew Andrews,et al.  Scheduling reserved traffic in input-queued switches: new delay bounds via probabilistic techniques , 2003, IEEE J. Sel. Areas Commun..

[23]  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..

[24]  M.J. Neely,et al.  Logarithmic delay for N/spl times/N packet switches , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[25]  Saswati Sarkar.  Optimum scheduling and memory management in input queued switches with finite buffer space , 2004, IEEE Transactions on Information Theory.