skip to main content
10.1145/3078505.3078509acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
abstract

Queue-Proportional Sampling: A Better Approach to Crossbar Scheduling for Input-Queued Switches

Published: 05 June 2017 Publication History

Abstract

Most present day switching systems, in Internet routers and data-center switches, employ a single input-queued crossbar to interconnect input ports with output ports. Such switches need to compute a matching, between input and output ports, for each switching cycle (time slot). The main challenge in designing such matching algorithms is to deal with the unfortunate tradeoff between the quality of the computed matching and the computational complexity of the algorithm. In this paper, we propose a general approach that can significantly boost the performance of both SERENA and iSLIP, yet incurs only O(1) additional computational complexity at each input/output port. Our approach is a novel proposing strategy, called Queue-Proportional Sampling (QPS), that generates an excellent starter matching. We show, through rigorous simulations, that when starting with this starter matching, iSLIP and SERENA can output much better final matching decisions, as measured by the resulting throughput and delay performance, than they otherwise can.

References

[1]
Histogram: A High Dynamic Range (HDR) Histogram. https://github.com/HdrHistogram/HdrHistogram.
[2]
T. E. Anderson, S. S. Owicki, J. B. Saxe, and C. P. Thacker. 1993. High-speed Switch Scheduling for Local-area Networks. ACM Trans. Comput. Syst. 11, 4 (Nov. 1993), pages 319--352. 0734--2071
[3]
S. Atalla, D. Cuda, P. Giaccone, and M. Pretti. 2013. Belief-Propagation-Assisted Scheduling in Input-Queued Switches. IEEE Trans. Comput. 62, 10 (Oct. 2013), pages 2101--2107. 0018--9340
[4]
M. Bayati, B. Prabhakar, D. Shah, and M. Sharma. 2007. Iterative Scheduling Algorithms. In Proceedings of the IEEE INFOCOM. Anchorage, AK, USA, pages 445--453.
[5]
M. Bayati, D. Shah, and M. Sharma. 2008. Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality. IEEE Transactions on Information Theory 54, 3 (Mar. 2008), pages 1241--1251. 0018--9448
[6]
G. Birkhoff. 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucumán Rev. Ser. Abi 5 (1946), pages 147--151.
[7]
J. Edmonds and R. M. Karp. 1972. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19, 2 (Apr. 1972), pages 248--264. 0004--5411
[8]
A. Eryilmaz, R. Srikant, and J. R. Perkins. 2001. Throughput-optimal scheduling for broadcast channels. In Proceedings of ITCom (Modeling and Design of Wireless Networks). Denver, CO.
[9]
J. Ghaderi and R. Srikant. 2010. On the design of efficient CSMA algorithms for wireless networks. In 49th IEEE Conference on Decision and Control (CDC). pages 954--959. 0191--2216
[10]
P. Giaccone, B. Prabhakar, and D. Shah. 2003. Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE Journal on Selected Areas in Communications 21, 4 (May 2003), pages 546--559.
[11]
M. W. Goudreau, S. G. Kolliopoulos, and S. B. Rao. 2000. Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation. In Proceedings of the IEEE INFOCOM. pages 1634--1643 vol.3.
[12]
G. R. Gupta, S. Sanghavi, and N. B. Shroff. 2009. Node Weighted Scheduling. In Proceedings of the ACM SIGMETRICS. Seattle, WA, USA, pages 97--108.
[13]
M. Karol, M. Hluchyj, and S. Morgan. 1987. Input Versus Output Queueing on a Space-Division Packet Switch. IEEE Transactions on Communications 35, 12 (Dec. 1987), pages 1347--1356. 0090--6778
[14]
I. Keslassy and N. McKeown. 2001. Analysis of scheduling algorithms that provide 100% throughput in input-queued switches. In Proceedings of the Allerton Conference on Communication, Control and Computing.
[15]
B. Li and R. Srikant. 2015. Queue-Proportional Rate Allocation with Per-Link Information in Multihop Networks. In Proceedings of the ACM SIGMETRICS. Portland, OR, USA, pages 97--108. x978--1--4503--3486-0
[16]
N. McKeown. 1995. Scheduling Algorithms for Input-Queued Cell Switches. Ph.D. Dissertation. University of California at Berkeley.
[17]
N. McKeown. 1999. The iSLIP Scheduling Algorithm for Input-queued Switches. IEEE/ACM Transactions on Networking 7, 2 (Apr. 1999), pages 188--201. 1063--6692
[18]
N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand. 1999. Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications 47, 8 (Aug. 1999), pages 1260--1267. 0090--6778
[19]
A. Mekkittikul and N. McKeown. 1998. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In Proceedings of the IEEE INFOCOM. pages 792--799 vol.2. 0743--166X
[20]
E. Modiano, D. Shah, and G. Zussman. 2006. Maximizing Throughput in Wireless Networks via Gossiping. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '06/Performance '06). ACM, New York, NY, USA, pages 27--38. x1--59593--319-0
[21]
J. v. Neumann. 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2 (1953), pages 5--12.
[22]
J. Ni, B. Tan, and R. Srikant. 2012. Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks. IEEE/ACM Transactions on Networking 20, 3 (June 2012), pages 825--836. 1063--6692
[23]
I. Olkin and A. W. Marshall. 2016. Inequalities: theory of majorization and its applications. Academic press.
[24]
S. Rajagopalan, D. Shah, and J. Shin. 2009. Network Adiabatic Theorem: An Efficient Randomized Protocol for Contention Resolution. In Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '09). ACM, New York, NY, USA, pages 133--144. 978--1--60558--511--6
[25]
K. Seong, R. Narasimhan, and J. M. Cioffi. 2006. Queue Proportional Scheduling in Gaussian Broadcast Channels. In 2006 IEEE International Conference on Communications, Vol. 4. pages 1647--1652. 1550--3607
[26]
K. Seong, R. Narasimhan, and J. M. Cioffi. 2006. Queue proportional scheduling via geometric programming in fading broadcast channels. IEEE Journal on Selected Areas in Communications 24, 8 (Aug 2006), pages 1593--1602. 0733--8716
[27]
D. Shah, P. Giaccone, and B. Prabhakar. 2002. Efficient randomized algorithms for input-queued switch scheduling. IEEE Microbibinfo 22, 1 (Jan. 2002), pages 10--18. 0272--1732
[28]
D. Shah and M. Kopikare. 2002. Delay bounds for approximate maximum weight matching algorithms for input queued switches. In Proceedings of the IEEE INFOCOM, Vol. 2. pages 1024--1031 vol.2. 0743--166X
[29]
D. Shah and J. Shin. 2012. RANDOMIZED SCHEDULING ALGORITHM FOR QUEUEING NETWORKS. The Annals of Applied Probability 22, 1 (2012), pages 128--171. 10505164 http://www.jstor.org/stable/41408096
[30]
D. Shah, N. Walton, and Y. Zhong. 2012. Optimal Queue-size Scaling in Switched Networks. In Proceedings of the ACM SIGMETRICS. ACM, New York, NY, USA, pages 17--28. 978--1--4503--1097-0
[31]
D. Shah and D. Wischik. 2006. Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM. Barcelona, Spain, pages 1--11. 0743--166X
[32]
D. Shah and D. Wischik. 2006. Optimal Scheduling Algorithms for Input-Queued Switches. In Proceedings of the IEEE INFOCOM. pages 1--11.
[33]
L. Tassiulas. 1998. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of the IEEE INFOCOM. San Francisco, CA, USA, pages 533--539.
[34]
L. Tassiulas and A. Ephremides. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Control 37, 12 (Dec. 1992), pages 1936--1948.
[35]
R. Tweedie. 1983. The existence of moments for stationary Markov chains. Journal of Applied Probability (1983), pages 191--196.
[36]
E. Vigoda. 2001. A note on the Glauber dynamics for sampling independent sets. Electronic Journal of Combinatorics 8, 1 (2001), pages 1--8.
[37]
N. Walton. 2014. Concave Switching in Single and Multihop Networks. In Proceedings of ACM SIGMETRICS. Austin, TX, USA, pages 139--151. 978--1--4503--2789--3
[38]
S. Ye, T. Shen, and S. Panwar. 2010. An O(1) Scheduling Algorithm for Variable-Size Packet Switching Systems. In Proceedings of the 48th Annual Allerton Conference. pages 1683--1690.

Cited By

View all
  • (2020)Scheduling Flows on a Switch to Optimize Response TimesProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400218(305-315)Online publication date: 6-Jul-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems
June 2017
84 pages
ISBN:9781450350327
DOI:10.1145/3078505
  • cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 45, Issue 1
    Performance evaluation review
    June 2017
    70 pages
    ISSN:0163-5999
    DOI:10.1145/3143314
    Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 2017

Check for updates

Author Tags

  1. crossbar scheduling
  2. input-queued switch
  3. matching
  4. queue-proportional sampling

Qualifiers

  • Abstract

Funding Sources

  • Australian Research Council grant
  • US NSF grants

Conference

SIGMETRICS '17
Sponsor:

Acceptance Rates

SIGMETRICS '17 Abstracts Paper Acceptance Rate 27 of 76 submissions, 36%;
Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Scheduling Flows on a Switch to Optimize Response TimesProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400218(305-315)Online publication date: 6-Jul-2020

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media