Skip to main content

HCN: A Server-Centric Network Topology for Data Centers

  • Chapter
  • First Online:
Data Center Networking
  • 553 Accesses

Abstract

A fundamental goal of data-center networking is to efficiently interconnect a large number of servers with the low equipment cost. Several server-centric network topologies for data centers have been proposed. They, however, are not truly expandable and suffer a low degree of regularity and symmetry. Inspired by the commodity servers in today’s data centers that come with dual-port, we consider how to build expandable and cost-effective topologies without expensive high-end switches and additional hardware on servers except the two NIC ports. In this chapter, two such network topologies, called HCN and BCN, are designed based on the compound graph theory. The two topologies can achieve hierarchical expansion by only adding a small number of links among servers. Although the server degree is only 2, HCN can be expanded very easily to encompass hundreds of thousands servers with the low diameter and high bisection width. HCN also offers high degree of regularity, scalability and symmetry, which conform to the modular design of data centers. BCN is the largest known network topology for data centers with the server degree 2 and network diameter 7. BCN has many attractive features, including the low diameter, high bisection width, large number of node-disjoint paths for the one- to-one traffic, and good fault-tolerant ability. Mathematical analysis and comprehensive simulations show that HCN and BCN possess excellent topological properties.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(4): 63–74.

    Google Scholar 

  2. Greenberg A, Hamilton J R, Jain N, et al. VL2: a scalable and flexible data center network [J]. ACM SIGCOMM Computer Communication Review, 2009, 39(4): 51–62.

    Google Scholar 

  3. Guo C, Wu H, Tan K, et al. Dcell: a scalable and fault-tolerant network structure for data centers [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(4): 75–86.

    Google Scholar 

  4. Li D, Guo C, Wu H, et al. FiConn: Using backup port for server interconnection in data centers [C]. In Proc. of 28th IEEE INFOCOM, Rio de Janeiro, Brazil, 2009: 2276–2285.

    Google Scholar 

  5. Li D, Guo C, Wu H, et al. Scalable and cost-effective interconnection of data-center servers using dual server ports [J]. IEEE/ACM Transactions on Networking, 2011, 19(1): 102–114.

    Google Scholar 

  6. Guo C, Lu G, Li D, et al. BCube: a high performance, server-centric network architecture for modular data centers [J]. ACM SIGCOMM Computer Communication Review, 2009, 39(4): 63–74.

    Google Scholar 

  7. Wu H, Lu G, Li D, et al. MDCube: a high performance network structure for modular data center interconnection [C]. In Proc. of 5th ACM CoNEXT, Rome, Italy, 2009: 25–36.

    Google Scholar 

  8. Alon N, Hoory S, Linial N. The Moore bound for irregular graphs [J]. Graphs and Combinatorics, 2002, 18(1): 53–57.

    Google Scholar 

  9. Damerell R M. On Moore graphs [C]. In Proc. of Cambridge Philosophical Society, Cambridge, UK, 1973:227–236.

    Google Scholar 

  10. Imase M and Itoh M. A design for directed graphs with minimum diameter [J]. IEEE Transactions on Computers, 1983, 32(8): 782–784.

    Google Scholar 

  11. Agrawal D P, Chen C, Burke J R. Hybrid graph-based networks for multiprocessing [J]. Telecommunication system, 1998, 10:107–134.

    Google Scholar 

  12. Breznay P T, Lopez M A. Tightly connected hierarchical interconnection networks for parallel processors [C]. In Proc. of 22th IEEE ICPP, NY, USA, 1993, 1: 307–310.

    Google Scholar 

  13. Breznay P T, Lopez M A. A class of static and dynamic hierarchical interconnection networks [C]. In Proc. of 23th IEEE ICCP, Raleigh, USA, 1994, 1:59–62.

    Google Scholar 

  14. Agrawal D P, Chen C, Burke J R. Hybrid graph-based networks for multiprocessing [J]. Telecommunication Systems, 1998, 10(1-2): 107–134.

    Google Scholar 

  15. Lu G, Shi Y, Guo C, et al. CAFE: a configurable packet forwarding engine for data center networks [C]. In Proc. of 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow, 2009: 25–30.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deke Guo .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Guo, D. (2022). HCN: A Server-Centric Network Topology for Data Centers. In: Data Center Networking. Springer, Singapore. https://doi.org/10.1007/978-981-16-9368-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-9368-7_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-9367-0

  • Online ISBN: 978-981-16-9368-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics