By Topic

Diameter bounds of cubelike recursive networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhoujun Li ; School of Computer, National University of Defense Technology, Changsha, China ; Yun Sun ; Deqiang Wang

The cubelike recursive networks is a special sub family of the binary interconnection networks. Typical cubelike recursive networks include the hypercube, the crossed cube, the Mobius cube, the generalized twisted cube, the twisted n-cube and the twisted-cube connected network. In a general sense, lots of their topological properties and network parameters are identical, but their diameters are quite different. This work makes the following contributions: Firstly, the definitions of sub-network and super-network are introduced to explain the recursive nature on structure of the cubelike recursive networks. Secondly, the supremum and infimum of the cubelike recursive networks' diameters are n and [~(n +1)/2] respectively, which are proved according to these definitions. Finally, a routing algorithm of cubelike recursive networks is proposed, with an example presented to explain how the algorithm works.

Published in:

Parallel and Distributed Systems, 2007 International Conference on  (Volume:2 )

Date of Conference:

5-7 Dec. 2007