Constructing Independent Spanning Trees on Transposition Networks

IEEE Access

Sun-Yuan Hsieh¹  Jie-Fu Huang¹  Chien-Fu Lin¹ 

[1] Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan;

关键词: Independent spanning trees;    transposition networks;    interconnection networks;    Cayley graphs;   

DOI  :  10.1109/ACCESS.2020.3014822

来源: DOAJ

【 摘 要 】

In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection node fails, users want to reconnect as rapidly as possible, it is urgently in need to construct a new path. Thus, searching node-disjoint paths is crucial for finding a new path in networks. In this article, we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks.

【 授权许可】

Unknown