Constructing Independent Spanning Trees on Transposition Network

  • 林 建夫

Student thesis: Doctoral Thesis

Abstract

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 thesis we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks
Date of Award2019
Original languageEnglish
SupervisorSun-Yuan Hsieh (Supervisor)

Cite this

'