MNCM: a critical node matching approach to scheduling for input buffered switches with no speedup

In this paper, we use fluid model techniques to es-tablish new results for the throughput of input-buffered switches. Dai and Prabhakar have shown that any maximal size matching algorithm with speedup of 2 achieves 100% throughput. We introduce the maximum node containing matching (MNCM), which is a new class of matching algorithms that achieve 100% throughput with no speedup. The only assumption on the arrival processes is they satisfy the strong law of large numbers (SLLN). The MNCM policies only need to include ports whose weight (backlog) are above a threshold in the matching rather than finding a matching with maximum total weight. This simplified requirement enables us to introduce a new matching algorithm, maximum first matching (MFM), with O(N2.5) complexity. We show that MFM is a low-complexity algorithm with good delay performance. We also provide a deterministic upper bound for the buffering requirement of a switch with an MNCM scheduler, when the ports incoming traffic are admissible and (σ, ρ) regulated.

[1]  Vahid Tarokh,et al.  Universal bounds on buffer size for packetizing fluid policies in input queued, crossbar switches , 2004, IEEE INFOCOM 2004.

[2]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[5]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[7]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[8]  Yuval Tamir,et al.  The design and implementation of a multiqueue buffer for VLSI communication switches , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Leandros Tassiulas,et al.  QoS provisioning and tracking fluid policies in input queueing switches , 2001, TNET.

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

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

[12]  Leandros Tassiulas,et al.  MNCM a new class of efficient scheduling algorithms for input-buffered switches with no speedup , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[14]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[15]  L. Tassiulas,et al.  Max-min fair self-randomized scheduler for input-buffered switches , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[16]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Paolo Giaccone,et al.  Towards simple, high-performance schedulers for high-aggregate bandwidth switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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