skip to main content
10.1145/3527974.3545717acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article

Meshed tree routing in folded-clos topologies

Published: 23 September 2022 Publication History

Abstract

Data Center Networks (DCNs) are the backbone of data centers. Folded-Clos topologies are used in data centers networks due to the high redundancy and scalability they offer. Capacity challenges and advanced applications are placing increased demands on DCNs. While there have been a number of major studies focused on improving hardware and topology design for DCNs, fewer efforts have been directed towards investigating new algorithms and protocols to work efficiently on the highly connected and symmetrical topologies adopted in DCNs. Instead, we notice the integration of off-the-shelf protocols that are then retrofitted to the DCN communication needs. This increases the operational complexity in DCNs. In this article, we investigate a new Meshed Tree protocol (MTP) based off a novel Meshed Tree algorithm (MTA) to perform control and data plane operations in folded-Clos DCNs. We present implementation details of MTP, tested using the Global Environment for Network Innovation (GENI) testbed, and highlight features such as redundant route establishment and load balancing.

References

[1]
Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. 2008. A Scalable, Commodity Data Center Network Architecture. In Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication (SIGCOMM '08). Association for Computing Machinery, New York, NY, USA, 63--74.
[2]
Mark Berman, Jeffrey S. Chase, Lawrence Landweber, Akihiro Nakao, Max Ott, et al. 2014. GENI: A Federated Testbed for Innovative Network Experiments. Computer Networks 61 (2014), 5--23.
[3]
Philippe Biondi. 2022. Scapy. https://scapy.net/
[4]
Charles Clos. 1953. A Study of Non-Blocking Switching Networks. The Bell System Technical Journal 32, 2 (March 1953), 406--424.
[5]
Chuanxiong Guo, Guohan Lu, Dan Li, Haitao Wu, Xuan Zhang, et al. 2009. BCube: A High Performance, Server-Centric Network Architecture for Modular Data Centers. In Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication (SIGCOMM '09). Association for Computing Machinery, New York, NY, USA, 63--74.
[6]
Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, et al. 2008. Dcell: A Scalable and Fault-Tolerant Network Structure for Data Centers. In ACM SIGCOMM Computer Communication Review, Vol. 38. 75--86.
[7]
P. Lapukhov, A. Premji, and J. Mitchell. 2016. Use of BGP for Routing in Large-Scale Data Centers. RFC 7938. RFC Editor / RFC Editor.
[8]
Charles E. Leiserson. 1985. Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Trans. Comput. C-34, 10 (Oct. 1985), 892--901.
[9]
John Moy. 1998. OSPF Version 2. STD 54. RFC Editor / RFC Editor.
[10]
Keyur Patel, Acee Lindem, Shawn Zandi, and Wim Henderickx. 2022. BGP Link-State Shortest Path First (SPF) Routing. Internet Draft draft-ietf-lsvr-bgp-spf-16. Internet Engineering Task Force.
[11]
Y. Rekhter, T. Li, and S. Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. RFC Editor / RFC Editor.
[12]
Alankar Sharma, Pascal Thubert, Bruno Rijsman, Dmitry Afanasiev, and Tony Przygienda. 2022. RIFT: Routing in Fat Trees. Internet Draft draft-ietf-rift-rift-15. Internet Engineering Task Force.
[13]
Peter Willis. 2022. PyMTP. https://github.com/pjw7904/PyMTP
[14]
Peter Willis and Nirmala Shenoy. 2019. A Meshed Tree Protocol for Loop Avoidance in Switched Networks. In 2019 International Conference on Computing, Networking and Communications (ICNC). 303--307.

Cited By

View all
  • (2024)Investigating Data Center Network ProtocolsProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674897(91-93)Online publication date: 23-Jul-2024
  • (2024)Resiliency in Networks Through Meshed Trees2024 15th International Conference on Network of the Future (NoF)10.1109/NoF62948.2024.10741359(45-53)Online publication date: 2-Oct-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
FIRA '22: Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing
August 2022
105 pages
ISBN:9781450393287
DOI:10.1145/3527974
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 September 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. clos topology
  2. data center networking
  3. meshed trees
  4. virtual IDs

Qualifiers

  • Research-article

Conference

SIGCOMM '22
Sponsor:
SIGCOMM '22: ACM SIGCOMM 2022 Conference
August 22, 2022
Amsterdam, Netherlands

Acceptance Rates

Overall Acceptance Rate 6 of 9 submissions, 67%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)19
  • Downloads (Last 6 weeks)3
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Investigating Data Center Network ProtocolsProceedings of the 2024 Applied Networking Research Workshop10.1145/3673422.3674897(91-93)Online publication date: 23-Jul-2024
  • (2024)Resiliency in Networks Through Meshed Trees2024 15th International Conference on Network of the Future (NoF)10.1109/NoF62948.2024.10741359(45-53)Online publication date: 2-Oct-2024

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media