article · 2007
Diameter bounds of cubelike recursive networks
Zhoujun Li, Yun Sun, Deqiang Wang
Cited by 0Abstract and details only
Abstract
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.
Cite this paper
Li, Z., Sun, Y., & Wang, D. (2007). Diameter bounds of cubelike recursive networks. https://doi.org/10.1109/icpads.2007.4447719
Li, Zhoujun, et al. “Diameter bounds of cubelike recursive networks.” vol. 26, 2007, pp. 1–8, https://doi.org/10.1109/icpads.2007.4447719.
Li, Zhoujun, Yun Sun, and Deqiang Wang. 2007. “Diameter bounds of cubelike recursive networks.” https://doi.org/10.1109/icpads.2007.4447719.
Li, Z., Sun, Y. and Wang, D. (2007) ‘Diameter bounds of cubelike recursive networks’. Available at: https://doi.org/10.1109/icpads.2007.4447719.
@article{li2007diameter,
title = {{Diameter bounds of cubelike recursive networks}},
author = {Li, Zhoujun and Sun, Yun and Wang, Deqiang},
volume = {26},
pages = {1--8},
year = {2007},
doi = {10.1109/icpads.2007.4447719}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.