CORPS-a pipelined fair packet scheduler for high speed switches

Input queues have become an attractive switch architecture, since it was shown that a throughput of up to 100% is achievable when a virtual output queue (VOQ) is used. Although schedulers for VOQ switches have been proposed, pipelined schedulers, whose processing requirements increase at most linearly with line speeds, have not yet matured. We introduce CORPS, a pipelined scheduler which allows fair scheduling among input lines of a crossbar high speed switch fabric. By means of a round-robin communication scheme, CORPS achieves scalability to a large number of ports. Moreover, CORPS achieves one scheduling decision per line per slot, by scheduling packets into future slots. The tradeoffs involved are packet delay and utilization.

[1]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  A. S. Acampora,et al.  Protocols for Optical Star-Coupler Network Using WDM: Performance and Complexity Study , 1993, IEEE J. Sel. Areas Commun..

[3]  K. Sivarajan.  Eecient Network Qos Provisioning Based on per Node Traac Shaping , 1996 .

[4]  Yuval Tamir,et al.  Symmetric Crossbar Arbiters for VLSI Communication Switches , 1993, IEEE Trans. Parallel Distributed Syst..

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

[6]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

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

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

[9]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[10]  Gopalakrishnan Ramamurthy,et al.  RRGS-round-robin greedy scheduling for electronic/optical terabit switches , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

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

[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]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[15]  Pravin Varaiya,et al.  Scheduling cells in an input-queued switch , 1993 .

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

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