| Summary: | 碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 103 === The one-to-many routing is to construct internally disjoint paths from one node to other nodes. It can ensure fault-tolerant broadcasting and secure message distribution in a network. Constructing multiple independent spanning trees rooted at one node can guarantee the one-to-many routing of the network.
A generalized Petersen network GP(n,k) is formed by connecting $n$ nodes of a regular polygon to the corresponding n nodes of a star polygon, where k is the skip distance of the star polygon. In this thesis, we take into consideration only a class of GP(n,k) where n and k are coprime.
The proposed algorithm in this thesis can construct three independent spanning trees based on the individual decision of every node in a generalized Petersen network. That is, the algorithm makes the one-to-many routing parallelized.
|
|---|
