Pipelined Scheduler for Unicast and Multicast Traffic in Input-Queued Switches

We focus on designing efficient integrated schedulers for handling mixed unicast and multicast traffic. We consider an input-queued switch with a multicast-capable switch fabric. At each input port of the switch, there are N dedicated unicast VOQs and one shared multicast queue (MQ). An existing approach to the design of integrated scheduler (i.e., a sequential scheduler) is to run two component schedulers, one for multicast and one for unicast, sequentially in each time slot. To minimize the head-of-line blocking of multicast traffic, the multicast scheduler always runs first. But sequentially running two schedulers in each time slot is challenging, especially when the slot duration is small. In this paper, we first propose a pipelined integration of the two component schedulers (i.e., a pipelined scheduler), which allows twice the amount of time for each scheduler to execute. We then extend an existing single-bit- single-iteration unicast scheduler to ensure that even in the presence of multicast traffic, unicast traffic will be starvation-free. This is achieved by giving unicast traffic priority over multicast periodically. Finally, we present arguably the first single-bit-single-iteration multicast scheduling algorithm. Extensive simulation results show that our pipelined scheduler is efficient and provides delay-throughput performance comparable to the sequential scheduler.

[1]  Saad Mneimneh Matching from the first iteration: an iterative switching algorithm for an input queued switch , 2008, TNET.

[2]  Sanjeev Khanna,et al.  Integrated scheduling of unicast and multicast traffic in an input-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).

[3]  Dominique Verchère,et al.  Fast scheduler solutions to the problem of priorities for polarized data traffic , 2001 .

[4]  Andrea Bianco,et al.  On the number of input queues to efficiently support multicast traffic in input queued switches , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[5]  G. Chartrand Introductory Graph Theory , 1984 .

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

[7]  Andrea Bianco,et al.  Distributed Scheduling in Input Queued Switches , 2007, 2007 IEEE International Conference on Communications.

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

[9]  Nick McKeown,et al.  Multicast Scheduling for Input-Queued Switches , 1997, IEEE J. Sel. Areas Commun..

[10]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

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

[12]  Nelson Ray Sollenberger,et al.  Beyond 3G: wideband wireless data access based on OFDM and dynamic packet assignment , 2000, IEEE Commun. Mag..

[13]  Cyriel Minkenberg,et al.  Fair Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch , 2006, 2006 IEEE International Conference on Communications.

[14]  J. Chao Saturn: a terabit packet switch using dual round robin , 2000 .

[15]  Min Song,et al.  Integration of unicast and multicast scheduling in input-queued packet switches , 2006, Comput. Networks.

[16]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[17]  Kwan-Wu Chin A new integrated unicast/multicast scheduler for input-queued switches , 2010 .

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