Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches

Summary form only given. An input-queued switch with virtual output queuing is able to provide a maximum throughput of 100% in the supporting more sophisticated scheduling strategies. Switch scheduling can be cast as a maximum flow problem. We propose a maximum weight bipartite matching (MWBM) scheduling algorithm for input-queued switches. Our goal is to provide 100% throughput while maintaining fairness and stability. Our algorithm provides sublinear parallel run time complexity using a polynomial number of processing elements. We are able to obtain the MWBM for a time slot in sublinear time by using the matching produced in the previous time slot based on the observation that in input-queued cell-based switches, the weight of edges changes very little during successive time slots. To the best of our knowledge, our algorithm outperforms all previously proposed MWBM scheduling algorithms proposed for input-queued switches. We also describe a linear time complexity MWBM algorithm for a general bipartite graph which outperforms the best known sublinear MWBM algorithm for any bipartite graph with less than 10/sup 15/ number of nodes.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Rui Zhang,et al.  Routers with a single stage of buffering , 2002, SIGCOMM '02.

[3]  Masayoshi Nabeshima.  Performance Evaluation of a Combined Input- and Crosspoint-Queued Switch , 2000 .

[4]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1995, CCRV.

[5]  Paolo Giaccone,et al.  Efficient Randomized Algorithms for Input-Queued Switch Scheduling , 2002, IEEE Micro.

[6]  H. T. Mouftah,et al.  Survey of ATM Switch Architectures , 1995, Comput. Networks ISDN Syst..

[7]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

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

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

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

[11]  Cyriel Minkenberg,et al.  Current issues in packet switch design , 2003, CCRV.

[12]  H. Obara.  Optimum architecture for input queuing ATM switches , 1991 .

[13]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[16]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[17]  Hamid Ahmadi,et al.  A survey of modern high-performance switching techniques , 1989, IEEE J. Sel. Areas Commun..

[18]  David R. Kaeli,et al.  Dynamic Input Buffer Allocation (DIBA) for Fault Tolerant Ethernet Packet Switching , 2003, PDPTA.

[19]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[20]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[21]  Nick McKeown,et al.  Making parallel packet switches practical , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Andrew V. Goldberg,et al.  Sublinear-Time Parallel Algorithms for Matching and Related Problems , 1993, J. Algorithms.

[23]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

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

[25]  Nick McKeown,et al.  On the speedup required for combined input- and output-queued switching , 1999, Autom..

[26]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

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

[28]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[29]  Cyriel Minkenberg,et al.  10 A Four-Terabit Packet Switch Supporting Long Round-Trip Times , 2003, IEEE Micro.