On reliable unicast and broadcast in bijective connection networks with the restricted node/edge faults
Jianxi Fan, Wujun Zhou, Dacheng Xu, Shukui Zhang · International Conference on Information Science and Technology · 2011
In this paper, we give an O(NlogN) algorithm to establish a spanning tree rooted at any node of height at most n + ⌈log2|F|⌉ + 3 in Xn− F, where F is a restricted node set with |F| ≤ 2n − 3 and N = 2ndenotes the node number of Xn. We also give and analyze the simulation results to apply the reliable unicast and broadcast algorithms in the literature and this paper to some existing bijective connection networks such as CQn, TQn, 0-MQn, and 1-MQnand general bijective connection networks Xn. The simulation results make us conjecture that there would be some special bijective connection networks whose diameters are smaller than the smallest diameter ⌈n+1 over 2⌉ of CQn, TQn, 0-MQn, and 1-MQn.