research-article

On Iterative Scheduling for Input-Queued Switches With a Speedup of $2-1/N$

Authors:

Chunzhi HeAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 24, Issue 6

Pages 3565 - 3577

https://doi.org/10.1109/TNET.2016.2541161

Published: 01 December 2016 Publication History

Abstract

An efficient iterative scheduling algorithm for input-queued switches, called round robin with longest queue first RR/LQF, is proposed in this paper. RR/LQF consists of three phases: report, grant, and accept. In each phase, only a single-bit message per port is sent for reporting a packet arrival, granting an input for packet sending, or accepting a grant. In both the grant and accept phases, scheduling priority is given to the preferred input–output pairs first and the longest virtual output queuing VOQ next. The notion of the preferred input–output pair is to keep a global RR schedule among all the inputs and the outputs. By serving the preferred input–output pairs first, the match size tends to be maximized. By serving the longest VOQ next, the match weight is also boosted. When RR/LQF is executed for a single iteration i.e., RR/LQF-1, we show by simulations that RR/LQF-1 outperforms all the existing single-bit-single-iteration scheduling algorithms. When RR/LQF is executed up to \(N\) iterations i.e., RR/LQF- \(N\), we prove that under any admissible traffic pattern, RR/LQF- \(N\) is stable with a speedup of \(2-1/N\), where \(N\) is the switch size. To the best of our knowledge, this is the first work showing that an iterative scheduling algorithm is stable with a speedup less than 2. We then generalize RR/LQF to become a class of algorithms that have the same speedup bound of \(2-1/N\). Efforts are then made to further reduce the implementation complexity of RR/LQF. To this end, the pipelined RR/LQF and RR/RR, a simpler variant of RR/LQF, are proposed.

References

[1]

E. Zahavi, I. Keslassy, and A. Kolodny, "Distributed adaptive routing convergence to non-blocking DCN routing assignments," IEEE J. Sel. Areas Commun., vol. 32, no. 1, pp. 88-101, Jan. 2014.

[2]

Z. Cao and S. S. Panwar, "Efficient buffering and scheduling for a single-chip crosspoint-queued switch," IEEE Trans. Commun., vol. 62, no. 6, pp. 2034-2050, Jun. 2014.

[3]

J. L. Ferrer, E. Baydal, A. Robles, P. López, and J. Duato, "Progressive congestion management based on packet marking and validation techniques," IEEE Trans. Comput., vol. 61, no. 9, pp. 1293-1310, Sep. 2012.

[4]

D. R. Hanks, Jr., Juniper QFX5100 Series: A Comprehensive Guide to Building Next-Generation Networks. Sebastopol, CA, USA: O'Reilly Media, Nov. 2014.

[5]

C. Gauthier. (Nov. 2011). Overcoming 40G/100G SerDes design and implementation challenges. EE Times. [Online]. Available: http://www.eetimes.com/document.asp?doc_id=1279194

[6]

Broadcom. High-capacity Strataxgs Trident II 104×10G/32×40G Ethernet Multilayer Switch Family Featuring Warpcore Serdes Interfaces, accessed on Mar. 19, 2016. [Online]. Available: https://www.broadcom.com/collateral/pb/56850-PB03-R.pdf

[7]

"Getting started with Cisco nexus 9000 series switches in the small-to-midsize commercial data center guide," Cisco, San Jose, CA, USA, White Paper C07-733228-00, Sep. 2015. [Online]. Available: http://www.cisco.com/c/en/us/products/collateral/switches/nexus-9000-series-switches/guide-c07-733228.html

[8]

High-Density 25/100 Gigabit Ethernet StrataXGS Tomahawk Ethernet Switch Series, accessed on Mar. 19, 2016. [Online]. Available: https://www.broadcom.com/products/ethernet-communication-and-switching/switching/bcm56960-series

[9]

"Cisco Nexus 5000 Series architecture: The building blocks of the unified fabric," Cisco, San Jose, CA, USA, White Paper C11-462176-03, Jun. 2009. [Online]. Available: http://www.cisco.com/c/en/us/products/collateral/switches/nexus-5020-switch/white_paper_c11-462176.html

[10]

N. McKeown, "The iSLIP scheduling algorithm for input-queued switches," IEEE/ACM Trans. Netw., vol. 7, no. 2, pp. 188-201, Apr. 1999.

[11]

M. J. Karol, M. G. Hluchyj, and S. P. Morgan, "Input versus output queueing on a space-division packet switch," IEEE Trans. Commun., vol. 35, no. 12, pp. 1347-1356, Dec. 1987.

[12]

Y. Tamir and G. L. Frazier, "High-performance multi-queue buffers for VLSI communications switches," in Proc. 15th Annu. Symp. Comput. Archit., Jun. 1988, pp. 343-354.

[13]

G. Chartrand, Introductory Graph Theory. New York, NY, USA: Dover, 1985, p. 116.

[14]

N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. 15th IEEE INFOCOM, San Francisco, CA, USA, Mar. 1996, pp. 296-302.

[15]

T. Anderson, S. S. Owicki, J. B. Saxe, and C. P. Thacker, "High-speed switch scheduling for local-area networks," ACM Trans. Comput. Syst., vol. 11, no. 4, pp. 319-352, 1993.

[16]

N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph.D. dissertation, Dept. Elect. Eng. Comput. Sci., Univ. California, Berkeley, Berkeley, CA, USA, 1995.

[17]

J. Chao, "Saturn: A terabit packet switch using dual round robin," IEEE Commun. Mag., vol. 38, no. 12, pp. 78-84, Dec. 2000.

[18]

G. Damm, J. Blanton, P. Golla, D. Verchère, and M. Yang, "Fast scheduler solutions to the problem of priorities for polarized data traffic," in Proc. Int. Symp. Telecommun. (IST), Tehran, Iran, 2001, pp. 1-4.

[19]

E. Leonardi, M. Mellia, M. A. Marsan, and F. Neri, "Stability of maximal size matching scheduling in input-queued cell switches," in Proc. IEEE ICC, New Orleans, LA, USA, Jun. 2000, pp. 1758-1763.

[20]

E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speed-up," IEEE/ACM Trans. Netw., vol. 9, no. 1, pp. 104-118, Feb. 2001.

[21]

A. Scicchitano, A. Bianco, P. Giaccone, E. Leonardi, and E. Schiattarella, "Distributed scheduling in input queued switches," in Proc. IEEE ICC, Glasgow, Scotland, Jun. 2007, pp. 6330-6335.

[22]

S. Mneimneh, "Matching from the first iteration: An iterative switching algorithm for an input queued switch," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 206-217, Feb. 2008.

[23]

C.-S. Chang, D.-S. Lee, and Y.-S. Jou, "Load balanced Birkhoff-von Neumann switches, part I: One-stage buffering," Comput. Commun., vol. 25, no. 6, pp. 611-622, 2002.

[24]

B. Hu and K. L. Yeung, "Feedback-based scheduling for load-balanced two-stage switches," IEEE/ACM Trans. Netw., vol. 18, no. 4, pp. 1077-1090, Aug. 2010.

[25]

B. Hu and K. L. Yeung, "Load-balanced optical switch for high-speed router design," J. Lightw. Technol., vol. 28, no. 13, pp. 1969-1977, Jul. 1, 2010.

[26]

K. Xi, Y.-H. Kao, and H. J. Chao, "A petabit bufferless optical switch for data center networks," in Optical Interconnects for Future Data Center Networks. New York, NY, USA: Springer, 2013, pp. 135-154.

[27]

D. Lin, Y. Jiang, and M. Hamdi, "Selective-request round-robin scheduling for VOQ packet switch architecture," in Proc. IEEE ICC, Kyoto, Japan, Jun. 2011, pp. 1-5.

[28]

M. S. Berger, "Delivering 100% throughput in a buffered crossbar with round robin scheduling," in Proc. IEEE HPSR, Poznan, Poland, Jun. 2006, pp. 403-407.

[29]

T. Javidi, R. Magill, and T. Hrabik, "A high-throughput scheduling algorithm for a buffered crossbar switch fabric," in Proc. IEEE ICC, Helsinki, Finland, Jun. 2001, pp. 1586-1591.

[30]

M. Hosaagrahara and H. Sethu, "Max-min fair scheduling in input-queued switches," IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 4, pp. 462-475, Apr. 2008.

[31]

D. A. Heger, "A disquisition on the performance behavior of binary search tree data structures," Eur. J. Inf. Professional, vol. 5, no. 5, pp. 67-75, Oct. 2004.

Cited By

Meng JGong LXu J(2021)Sliding-Window QPS (SW-QPS)ACM SIGMETRICS Performance Evaluation Review10.1145/3453953.345396948:3(71-76)Online publication date: 5-Mar-2021
https://dl.acm.org/doi/10.1145/3453953.3453969
Gong LXu JLiu LMaguluri S(2020)QPS-rProceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3388831.3388836(19-26)Online publication date: 18-May-2020
https://dl.acm.org/doi/10.1145/3388831.3388836
Wang LYe TLee THu W(2018)A Parallel Complex Coloring Algorithm for Scheduling of Input-Queued SwitchesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.280252329:7(1456-1468)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1109/TPDS.2018.2802523

On Iterative Scheduling for Input-Queued Switches With a Speedup of $2-1/N$
1. Networks
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Frame-based packet scheduling algorithms for input queued switches
Frame-Based Packet-Mode Scheduling for Input-Queued Switches

Most packet scheduling algorithms for input-queued switches operate on fixed-sized packets known as cells. In reality, communication traffic in many systems such as Internet runs on variable-sized packets. Motivated by potential savings of segmentation ...
A logarithmic scheduling algorithm for high speed input-queued switches

Throughput of input queued switches using FIFOs is limited due to the Head of Line blocking (HoL) problem. Using VOQs at inputs and a proper scheduling algorithm, near 100% throughput can be achieved. Scaling in terms of number of ports and line rates ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 24, Issue 6

December 2016

635 pages

ISSN:1063-6692

Issue’s Table of Contents

Copyright © 2016.

Publisher

IEEE Press

Publication History

Published: 01 December 2016

Published in TON Volume 24, Issue 6

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
52
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Meng JGong LXu J(2021)Sliding-Window QPS (SW-QPS)ACM SIGMETRICS Performance Evaluation Review10.1145/3453953.345396948:3(71-76)Online publication date: 5-Mar-2021
https://dl.acm.org/doi/10.1145/3453953.3453969
Gong LXu JLiu LMaguluri S(2020)QPS-rProceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools10.1145/3388831.3388836(19-26)Online publication date: 18-May-2020
https://dl.acm.org/doi/10.1145/3388831.3388836
Wang LYe TLee THu W(2018)A Parallel Complex Coloring Algorithm for Scheduling of Input-Queued SwitchesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.280252329:7(1456-1468)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1109/TPDS.2018.2802523

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents