Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes

Abstract : Reliable broadcasting for interconnection networks can be achieved by constructing multiple independent spanning trees(ISTs) rooted at the same node. In this paper, we prove that there exists (n − 1)! sets of ISTs rooted at an arbitrary node for Qn and Mn based on circular dimensional-permutations of 0, 1, …, n − 1 and n ≥ 1. At the same time, we give an parallel algorithm, called BCIST, which is the further study of IST problem for Qn and Mn in literature. Furthermore, simulation experiments of ISTs based on JUNG framework and different sets of disjoint paths between node 1 and any node v ∈ V(0-M4)\{1} for 0-M4 are also presented.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-01513766
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 25, 2017 - 2:33:32 PM
Last modification on : Tuesday, April 25, 2017 - 2:35:50 PM
Document(s) archivé(s) le : Wednesday, July 26, 2017 - 2:08:48 PM

File

978-3-642-40820-5_20_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Baolei Cheng, Jianxi Fan, Jiwen Yang, Xi Wang. Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.232-244, ⟨10.1007/978-3-642-40820-5_20⟩. ⟨hal-01513766⟩

Share

Metrics

Record views

38

Files downloads

38