Abstract
Load-balanced switch architectures are known to be scalable in both size and speed, which is of interest due to the continued exponential growth in Internet traffic. However, the main drawback of load-balanced switches is that packets can depart out of order from the switch. Randomized load-balancing of application flows by means of hashing on the packet header is a well-known simple solution to this packet reordering problem in which all packets belonging to the same application flow are routed through the same intermediate port and hence the same path through the switch. Unfortunately, this method of load-balancing can lead to instability, depending on the mix of flow sizes and durations in the group of flows that gets randomly assigned to route through the same intermediate port. In this paper, we show that the randomized load-balancing of application flows can be enhanced to provably guarantee both stability and packet ordering by extending the approach with safety mechanisms that can uniformly diffuse packets across the switch whenever there is a build-up of packets waiting to route through some intermediate port. Although simple and intuitive, our experimental results show that our extended randomized load-balancing approach outperforms existing load-balanced switch architectures.
- Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Data Center Networks.. In NSDI, Vol. 10. 19--19. Google Scholar
Digital Library
- Mohammad Alizadeh, Tom Edsall, Sarang Dharmapurikar, Ramanan Vaidyanathan, Kevin Chu, Andy Fingerhut, Francis Matus, Rong Pan, Navindra Yadav, George Varghese, et al. 2014. CONGA: Distributed congestion-aware load balancing for datacenters. In ACM SIGCOMM Computer Communication Review, Vol. 44. ACM, 503--514. Google Scholar
Digital Library
- Brahim Bensaou, KT Chan, and Danny HK Tsang. 1997. Credit-based fair queueing (CBFQ): A simple and feasible scheduling algorithm for packet networks. In IEEE ATM Workshop 1997. Proceedings. IEEE, 589--594.Google Scholar
Cross Ref
- Theophilus Benson, Ashok Anand, Aditya Akella, and Ming Zhang. 2011. MicroTE: Fine grained traffic engineering for data centers. In Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies. ACM, 8. Google Scholar
Digital Library
- Jiaxin Cao, Rui Xia, Pengkun Yang, Chuanxiong Guo, Guohan Lu, Lihua Yuan, Yixin Zheng, Haitao Wu, Yongqiang Xiong, and Dave Maltz. 2013. Per-packet load-balanced, low-latency routing for clos-based data center networks. In Proceedings of the ninth ACM conference on Emerging networking experiments and technologies. ACM, 49--60. Google Scholar
Digital Library
- Cheng-Shang Chang, Duan-Shin Lee, and Yi-Shean Jou. 2002. Load balanced Birkhoff--von Neumann switches, part I: one-stage buffering. Computer Communications 25, 6 (2002), 611--622. Google Scholar
Digital Library
- Cheng-Shang Chang, Duan-Shin Lee, and Ching-Ming Lien. 2002. Load balanced Birkhoff--von Neumann switches, part II: multi-stage buffering. Computer Communications 25, 6 (2002), 623--634. Google Scholar
Digital Library
- J. G. Dai. 1998. Stability of fluid and stochastic processing networks. University of Aarhus. Centre for Mathematical Physics and Stochastics (MaPhySto){MPS}.Google Scholar
- J. G. Dai and Balaji Prabhakar. 2000. The throughput of data switches with and without speedup. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2. IEEE, 556--564.Google Scholar
Cross Ref
- Weijun Ding, Jun Xu, J. G. Dai, Yang Song, and Bill Lin. 2014. Sprinklers: A randomized variable-size striping approach to reordering-free load-balanced switching. In ACM CoNext, the 10th International Conference on Emerging Networking EXperiments and Technologies. ACM. Google Scholar
Digital Library
- Paolo Giaccone, Balaji Prabhakar, and Devavrat Shah. 2003. Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE Journal on Selected Areas in Communications 21, 4 (2003), 546--559. Google Scholar
Digital Library
- Albert Greenberg, James R Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A Maltz, Parveen Patel, and Sudipta Sengupta. 2009. VL2: a scalable and flexible data center network. In ACM SIGCOMM computer communication review, Vol. 39. ACM, 51--62. Google Scholar
Digital Library
- Keqiang He, Eric Rozner, Kanak Agarwal, Wes Felter, John Carter, and Aditya Akella. 2015. Presto: Edge-based load balancing for fast datacenter networks. ACM SIGCOMM Computer Communication Review 45, 4 (2015), 465--478. Google Scholar
Digital Library
- Juan José Jaramillo, Fabio Milan, and R Srikant. 2008. Padded frames: a novel algorithm for stable scheduling in load-balanced switches. Networking, IEEE/ACM Transactions on Networking 16, 5 (2008), 1212--1225. Google Scholar
Digital Library
- Srikanth Kandula, Dina Katabi, Shantanu Sinha, and Arthur Berger. 2007. Dynamic load balancing without packet reordering. ACM SIGCOMM Computer Communication Review 37, 2 (2007), 51--62. Google Scholar
Digital Library
- Isaac Keslassy. 2004. The load-balanced router. Ph.D. Dissertation. Stanford University. Google Scholar
Digital Library
- HT Kung, Trevor Blackwell, and Alan Chapman. 1994. Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing. In ACM SIGCOMM Computer Communication Review, Vol. 24. ACM, 101--114. Google Scholar
Digital Library
- Bill Lin and Isaac Keslassy. 2010. The concurrent matching switch architecture. Networking, IEEE/ACM Transactions on 18, 4 (2010), 1330--1343. Google Scholar
Digital Library
- Siva Theja Maguluri, R Srikant, and Lei Ying. 2012. Stochastic models of load balancing and scheduling in cloud computing clusters. In INFOCOM, 2012 Proceedings IEEE. IEEE, 702--710.Google Scholar
Cross Ref
- Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, and Amin Vahdat. 2009. Portland: a scalable fault-tolerant layer 2 data center network fabric. In ACM SIGCOMM Computer Communication Review, Vol. 39. ACM, 39--50. Google Scholar
Digital Library
- Cüneyt Özveren, Robert Simcoe, and George Varghese. 1994. Reliable and efficient hop-by-hop flow control. In ACM SIGCOMM Computer Communication Review, Vol. 24. ACM, 89--100. Google Scholar
Digital Library
- Costin Raiciu, Sebastien Barre, Christopher Pluntke, Adam Greenhalgh, Damon Wischik, and Mark Handley. 2011. Improving datacenter performance and robustness with multipath TCP. In ACM SIGCOMM Computer Communication Review, Vol. 41. ACM, 266--277. Google Scholar
Digital Library
- Mehrnoosh Shafiee and Javad Ghaderi. 2017. A simple congestion-aware algorithm for load balancing in datacenter networks. IEEE/ACM Transactions on Networking (2017).Google Scholar
- Madhavapeddi Shreedhar and George Varghese. 1995. Efficient fair queueing using deficit round robin. In ACM SIGCOMM Computer Communication Review, Vol. 25. ACM, 231--242. Google Scholar
Digital Library
- Jonathan Turner. 1986. New directions in communications(or which way to the information age?). IEEE communications Magazine 24, 10 (1986), 8--15. Google Scholar
Digital Library
- Leslie G. Valiant. 1982. A scheme for fast parallel communication. SIAM journal on computing 11, 2 (1982), 350--361.Google Scholar
- Sen Yang, Bill Lin, Paul Tune, and Jun Jim Xu. 2017. A simple re-sequencing load-balanced switch based on analytical packet reordering bounds. In INFOCOM 2017-IEEE Conference on Computer Communications, IEEE. IEEE, 1--9.Google Scholar
Cross Ref
- Sen Yang, Bill Lin, and Jun Xu. 2016. Safe Randomized Load-Balanced Switching by Diffusing Extra Loads. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. ACM, 397--398. Google Scholar
Digital Library
- Qi Zhao, Jun Xu, and Zhen Liu. 2006. Design of a novel statistics counter architecture with optimal space and time efficiency. ACM SIGMETRICS Performance Evaluation Review 34, 1 (2006), 323--334. Google Scholar
Digital Library
Index Terms
Safe Randomized Load-Balanced Switching By Diffusing Extra Loads
Recommendations
Safe Randomized Load-Balanced Switching by Diffusing Extra Loads
SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer ScienceLoad-balanced switch architectures are known to be scalable in both size and speed, which is of interest due to the continued exponential growth in Internet traffic. However, the main drawback of load-balanced switches is that packets can depart out of ...
Safe Randomized Load-Balanced Switching by Diffusing Extra Loads
SIGMETRICS '18Load-balanced switch architectures are known to be scalable in both size and speed, which is of interest due to the continued exponential growth in Internet traffic. However, the main drawback of load-balanced switches is that packets can depart out of ...
Safe Randomized Load-Balanced Switching by Diffusing Extra Loads
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer SystemsLoad-balanced switch architectures are known to be scalable in both size and speed, which is of interest due to the continued exponential growth in Internet traffic. However, the main drawback of load-balanced switches is that packets can depart out of ...






Comments