Constructing edge-disjoint spanning trees in twisted cubes |
| |
Authors: | Ming-Chien Yang [Author Vitae] |
| |
Affiliation: | Department of Knowledge Management, Aletheia University, Tainan County 721, Taiwan |
| |
Abstract: | The use of edge-disjoint spanning trees or independent spanning trees in a network for data broadcasting has the benefits of increased of bandwidth and fault-tolerance. In this paper, we propose an algorithm which constructs n edge-disjoint spanning trees in the n-dimensional twisted cube, denoted by TQn. Because the n-dimensional twisted cube is n-regular, the result is optimal with respect to the number of edge-disjoint spanning trees constructed. Furthermore, we also show that of the n edge-disjoint spanning trees constructed are independent spanning trees. This algorithm runs in time O(N log N) and can be parallelized to run in time O(log N) where N is the number of nodes in TQn. |
| |
Keywords: | Algorithms Edge-disjoint spanning trees Independent spanning trees Data broadcasting Fault-tolerance Twisted cubes Interconnection networks |
本文献已被 ScienceDirect 等数据库收录! |