Skip to main content
Log in

KMcube: the compound of Kautz digraph and Möbius cube

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

This paper introduces a novel interconnection network called KMcube (Kautz-Möbius cube). KMcube is a compound graph of a Kautz digraph and Möbius cubes. That is, it uses the Möbius cubes as the unit cluster and connects many such clusters by means of a Kautz digraph at the cost of only one additional arc being added to any node in each Möbius cubes. The topological benefits of both basic graphs are preserved in the compound network. It utilizes the topological properties of Möbius cubes to conveniently embed parallel algorithms into each cluster and the short diameter of a Kautz digraph to support efficient inter-cluster communication. Additionally, KMcube provides other attractive properties, such as the regularity, symmetry, and expandability. The proposed methodology for KMcube is further applied to the compound graphs of Kautz digraph and other Möbius-like graphs with the similar diameter to a Möbius cube. Moreover, other hybrid graphs of Kautz digraph and Möbius cubes are proposed and compared.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Guo C, Wu H, Tan K, Shi L, Zhang Y, Lu S. Dcell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM Computer Communication Review, 2008, 38(4): 75–86

    Article  Google Scholar 

  3. Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S. Bcube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Computer Communication Review, 2009, 39(4): 63–74

    Article  Google Scholar 

  4. Guo D, Zhu G, Jin H, Yang P, Chen Y, Yi X, Liu J. Möbius-debruijn: The product of möbius cube and debruijn digraph. Information Processing Letter, 2012, 112(5): 205–211

    Article  MathSciNet  MATH  Google Scholar 

  5. Wang C, Xiao L, Liu Y, Zheng P. Dicas: an efficient distributed caching mechanism for P2P systems. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(10): 1097–1109

    Article  Google Scholar 

  6. Guo D, Wu J, Liu Y, Jin H, Chen H, Chen T. Quasi-kautz digraphs for peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 2011, 22(6): 1042–1055

    Article  Google Scholar 

  7. He Y, Liu Y. VOVO: vcr-oriented video-on-demand in large-scale peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 2009, 20(4): 528–539

    Article  Google Scholar 

  8. Cull P, Larson S. Routing in twisted cube-like networks. In: Proceedings of the 2000 International Conference on Communications in Computing. 2000, 225

    Google Scholar 

  9. Agrawal D, Chen C, Burke J. Hybrid graph-based networks for multiprocessing. Telecommunication Systems, 1998, 10(1): 107–134

    Article  Google Scholar 

  10. Shen H, Xu C, Chen G. Cycloid: a constant-degree and lookup-efficient P2P overlay network. Performance Evaluation, 2006, 63(3): 195–216

    Article  Google Scholar 

  11. Shen H, Xu C. Leveraging a compound graph-based dht for multi-attribute range queries with performance analysis. IEEE Transactions on Computers, 2012, 61(4): 433–447

    Article  MathSciNet  Google Scholar 

  12. Chen C, Agrawal D. dBCube: a new class of hierarchical multiprocessor interconnection networks with area efficient layout. IEEE Transactions on Parallel and Distributed Systems, 1993, 4(12): 1332–1344

    Article  Google Scholar 

  13. Guo D, Chen H, He Y, Jin H, Chen C, Chen H, Shu Z, Huang G. KCube: a novel architecture for interconnection networks. Information Processing Letters, 2010, 110(18): 821–825

    Article  MathSciNet  MATH  Google Scholar 

  14. Larson S, Cull P. TheMöbius cubes. IEEE Transactions on Computers, 1995, 44(5): 647–659

    Article  MathSciNet  MATH  Google Scholar 

  15. Singhvi N, Ghose K. The Mcube: a symmetrical cube based network with twisted links. In: Proceedings of the 9th International Parallel Processing Symposium. 1995, 11–16

    Chapter  Google Scholar 

  16. Guo D, Chen T, Li D, Liu Y, Liu X, Chen G. Bcn: expansible network structures for data centers using hierarchical compound graphs. In: Proceedings of the 2011 IEEE INFOCOM. 2011, 61–65

    Chapter  Google Scholar 

  17. Panchapakesan G, Sengupta A. On a lightwave network topology using Kautz digraphs. IEEE Transactions on Computers, 1999, 48(10): 1131–1137

    Article  MathSciNet  Google Scholar 

  18. Miller M, Širán J. Moore graphs and beyond: a survey of the degree/diameter problem. Electronic Journal of Combinatorics, 2005, 61: 1–63

    Google Scholar 

  19. Ghozati S, Smires T. The fastcube: a variation on hypercube topology with lower diameter. Computers & Electrical Engineering, 2003, 29(1): 151–171

    Article  MATH  Google Scholar 

  20. Park J, Kim H, Lim H. Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(3): 227–240

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deke Guo.

Additional information

Xianpeng Huangfu received the MS degree in operational research from the National University of Defense Technology (NUDT), Changsha, China in 2008. Currently, he is a PhD student in operational research in NUDT. His main interests include interconnection networks, information grid, and service computing.

Deke Guo received the BS degree in industry engineering from Beihang University, Beijing, China in 2001, and the PhD degree in management science and engineering from NUDT, China in 2008. He was a visiting scholar at the Department of Computer Science and Engineering in Hong Kong University of Science and Technology, China from 2007 to 2009. He is an associate professor with the College of Information System and Management, NUDT, Changsha, China. His research interests include distributed systems, wireless and mobile systems, P2P networks, and interconnection networks. He is a member of the ACM and the IEEE.

Honghui Chen received the MS degree in operational research and the PhD degree in management science and engineering from NUDT, China in 1994 and 2007, respectively. Currently, he is a professor of information system and management, NUDT. His research interests are requirement engineering, Web services, information grid, and peer-to-peer networks. He has coauthored three books in the past five years.

Xueshan Luo received the BE degree in information engineering from Huazhong Institute of Technology, Wuhan, China in 1985, and the MS and PhD degrees in system engineering from NUDT, China in 1988 and 1992, respectively. He was a faculty member and an associate professor at NUDT from 1992 to 1994 and from 1995 to 1998, respectively. Currently, he is a professor of information system and management, NUDT. His research interests are in the general areas of information system and operation research. His current research focuses on architecture of information system.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huangfu, X., Guo, D., Chen, H. et al. KMcube: the compound of Kautz digraph and Möbius cube. Front. Comput. Sci. 7, 298–306 (2013). https://doi.org/10.1007/s11704-013-2016-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-013-2016-7

Keywords

Navigation