Skip to main content

On the Mathematics of Data Centre Network Topologies

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9210))

Included in the following conference series:

  • 653 Accesses

Abstract

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to-server diameter). Unfortunately there were flaws in some of the proofs in that paper. We correct these flaws here and extend the results so as to prove that the core combinatorial construction, namely the 3-step construction, results in data centre networks with optimal path diversity.

I.A. Stewart—Supported by EPSRC grant EP/K015680/1 ‘Interconnection Networks: Practice unites with Theory (INPUT)’.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)

    Article  Google Scholar 

  2. Bermond, J.C., Bond, J., Djelloul, S.: Dense bus networks of diameter 2. In: Proceedings of the Workshop on Interconnection Networks. DIMACS Series vol. 21, pp. 9–18 (1995)

    Google Scholar 

  3. Greenberg, A., Hamilton, J.R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: VL2: a scalable and flexible data center network. SIGCOMM Comput. Commun. Rev. 39(4), 51–62 (2009)

    Article  Google Scholar 

  4. Liu, Y., Muppala, J.K., Veeraraghavan, M., Lin, D., Katz, J.: Data Centre Networks: Topologies, Architectures and Fault-Tolerance Characteristics. Springer, Heidelberg (2013)

    Google Scholar 

  5. Mysore, R.N., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., Vahdat, A.: Portland: a scalable fault-tolerant layer 2 data center network fabric. SIGCOMM Comput. Commun. Rev. 39(4), 39–50 (2009)

    Article  Google Scholar 

  6. Qu, G., Fang, Z., Zhang, J., Zheng, S.-Q.: Switch-centric data center network structures based on hypergraphs and combinatorial block designs. IEEE Trans. on Par. Distrib. Sys. 26(4), 154–1164 (2015)

    Google Scholar 

  7. Wu, K., Xiao, J., Ni, L.M.: Rethinking the architecture design of data center networks. Frontiers of Comput. Sci. 6(5), 596–603 (2012)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iain A. Stewart .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Stewart, I.A. (2015). On the Mathematics of Data Centre Network Topologies. In: Kosowski, A., Walukiewicz, I. (eds) Fundamentals of Computation Theory. FCT 2015. Lecture Notes in Computer Science(), vol 9210. Springer, Cham. https://doi.org/10.1007/978-3-319-22177-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22177-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22176-2

  • Online ISBN: 978-3-319-22177-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics