Skip to main content
SpringerLink
Log in

Efficient implementation of multi-level Dragonfly networks with Hamming graph for future optical networks

  • Research Article
  • Published:
Journal of Optics Aims and scope Submit manuscript

Abstract

With the emergence of cloud computing and virtualized infrastructure in the datacenters, the use of high-radix routers is the most cost-effective alternative for interconnection networks. They are typically utilized as a part of datacenters for High-Performance Computing (HPC). Software Defined Networking (SDN) consolidates the benefits of datacenter virtualization, increasing resource flexibility and utilization and reducing infrastructure costs and overhead. Datacenter networks should be able to ensure high throughput and resiliency. For such reasons, Hamming graphs and Dragonfly networks are suitable for use with high-radix routers. Multilevel Dragonfly networks are used for lower-radix routers to increase the maximum achievable system size with the same router design. This paper introduces Hamming graphs and Dragonfly topologies based on SDN basis. It also presents a novel addressing scheme for Dragonfly topology with simulation experiments. The proposed model will be used for minimal, non-minimal, and adaptive routing in Dragonfly networks to extract a Python code using Mininet, which includes MiniEdit that is used to create and run network simulations. Evaluations show that with global trunking, systems are built with fewer groups than the maximum allowed. Therefore, there is no compelling reason for an additional cost. The proposed recommendations will be useful in the implementation of optical networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. F.S. Fizi ,S. Askar in, A novel load balancing algorithm for software defined network based datacenters”, International Conference on Broadband Communications for Next Generation Networks and Multimedia Applications (CoBCom), (Graz, Austria 2016), p. 1–6. https://doi.org/10.1109/COBCOM.2016.7593506

  2. M. Al-Fares, A. Loukissas, A. Vahdat, A scalable, commodity data center network architecture. ACM SIGCOMM Compt. Commun. Rev. 38(4), 63–74 (2008)

    Article  Google Scholar 

  3. J. Kim, W. J. Dally, D. Abts, in Flattened butterfly: a cost-efficient topology for high-radix networks, Proceedings of the 34th annual international symposium on Computer architecture. (2007)

  4. M.F. Bari, R. Boutaba, R. Esteves, Data center Network virtualization: a survey. IEEE Commun. Surv. Tutor. 15(2), 909–928 (2013). https://doi.org/10.1109/SURV.2012.090512.00043

    Article  Google Scholar 

  5. T.A. Yang, N. Joshy, E. Rojas, S. Anumula, J. Moola, Virtualization and data center design. Glob. J. Technol. 9, 36–54 (2015)

    Google Scholar 

  6. E.-S. Jung, V. Vishwanath, R. Kettimuthu, in Distributed Multipath Routing Algorithm for Data Center Networks, International Workshop on Data Intensive Scalable Computing Systems, New Orleans, (LA, USA, 2014), p. 49–56. https://doi.org/10.1109/DISCS.2014.14‏

  7. N. Maksic, A. Smiljanic, Improving utilization of data center networks. IEEE Commun. Mag. 51(11), 32–38 (2013). https://doi.org/10.1109/MCOM.2013.6658649

    Article  Google Scholar 

  8. Z. Han, W. Ren, A novel wireless sensor networks structure based on the SDN. Int. J. Distrib. Sens. Netw. 10(3), 874047 (2014)

    Article  Google Scholar 

  9. N. McKeown, T. Anderson, H. Balakrishnan, OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008)

    Article  Google Scholar 

  10. D.R. Hawtin, s-Elusive codes in Hamming graphs. Des. Codes Crypt. 89, 1211–1220 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Barta, R. Montemanni (2017) Hamming Graphs and Permutation Codes Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), Corfu Greece. https://doi.org/10.1109/MCSI.2017.35

  12. J. Kim, W.J. Dally, S. Scott, D. Abts, Technology-driven, highly-scalable dragonfly topology. ACM SIGARCH Computer Architecture News. 36(3), 77–88 (2008)

    Article  Google Scholar 

  13. B. Arimilli, R. Arimilli, V. Chung, S. Clark, W. Denzel, B. Drerup, R. Rajamony, in The PERCS high-performance interconnect, 18th IEEE Symposium on High Performance Interconnects. (2010)

  14. A. Agarwal, Limits on interconnection network performance. IEEE Trans. Parallel Distrib. Syst. 2(4), 398–412 (1991). https://doi.org/10.1109/71.97897

    Article  Google Scholar 

  15. W.J. Dally, Performance analysis of k-ary n-cube interconnection networks. IEEE Trans. Comput. 39(6), 775–785 (1990). https://doi.org/10.1109/12.53599

    Article  MathSciNet  Google Scholar 

  16. J. Kim, W. J. Dally, B. Towles, A. K. Gupta, Microarchitecture of a high radix router, 32nd International Symposium on Computer Architecture (ISCA'05), (Madison, WI, 2005). p. 240–431. https://doi.org/10.1109/ISCA.2005.35

  17. P. P. Sahu, A new shared protection scheme in optical network, Current science. p. 1176–1183 (2006)

  18. F.L. Verdi, C. Carvalho, M.F. Magalhães, Policy-based grooming in optical networks. J. Netw. Syst. Manage. 16(4), 325–349 (2008)

    Article  Google Scholar 

  19. C. Camarero, E. Vallejo, R. Beivide, Topological characterization of hamming and dragonfly networks and its implications on routing. ACM Trans. Archit. Code Optim. (TACO). 11(4), 1–25 (2014)

    Google Scholar 

  20. M. García, E. Vallejo, R. Beivide, in On-the-Fly Adaptive Routing in High-Radix Hierarchical Networks, 41st International Conference on Parallel Processing, (Pittsburgh, PA, 2012), p. 279–288. https://doi.org/10.1109/ICPP.2012.46

  21. B. Lantz, B. Heller, N. McKeown, “A network in a laptop: rapid prototyping for software-defined networks”, Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks. (2010)

  22. G. Faanes, A. Bataineh, D. Roweth, in Cray Cascade: A scalable HPC system based on a Dragonfly network, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (Salt Lake City, UT, 2012). p. 1–9. https://doi.org/10.1109/SC.2012.39

  23. A. Singh, in Load-Balancing Routing in Interconnection Network, Diss. PhD Dissertation. Standford University. Advisor (s) William J. Dally. (2005)

  24. A.J. Hoffman, R.R. Singleton, On moore graphs with diameters 2 and 3. IBM J. Res. Dev. 4(5), 497–504 (1960). https://doi.org/10.1147/rd.45.0497

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Department, Benha Faculty of Engineering, Benha University, Banha, Egypt

    Heba A. Hassan & Amr A. Al-Awamry

  2. College of Computing and Information Technology, Arab Academy for Science, Technology & Maritime Transport, Cairo, Egypt

    M. B. Abdelhalim

  3. Department of Electronics and Electrical Communications Engineering, Faculty of Electronic Engineering, Menoufia University, Menouf 32952, Egypt

    Heba A. Hassan & Fathi E. Abd El-Samie

  4. Department of Information Technology, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia

    Fathi E. Abd El-Samie

Authors
  1. Heba A. Hassan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amr A. Al-Awamry
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. B. Abdelhalim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fathi E. Abd El-Samie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heba A. Hassan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hassan, H.A., Al-Awamry, A.A., Abdelhalim, M.B. et al. Efficient implementation of multi-level Dragonfly networks with Hamming graph for future optical networks. J Opt 52, 2188–2198 (2023). https://doi.org/10.1007/s12596-023-01142-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12596-023-01142-9

Keywords

Search

Navigation