A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph
碩士 === 國立中山大學 === 資訊工程學系研究所 === 96 === In this thesis, we focus on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph. First, we build the probabili...
Main Authors: | Chiao-Wei Chiu, 邱喬偉 |
---|---|
Other Authors: | Chang-Biau Yang |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/u99jrh |
Similar Items
-
Fault-Tolerant Routing on the Star Graph Using Safety Vectors
by: Sheng-I Yeh, et al. -
k-pairwise cluster fault tolerant routing in star graphs
by: Xu, Zhen-Tong, et al.
Published: (1997) -
A Study of Fault-Tolerant Routing on Star Graph Using Limited- Global-Information
by: Chang, Chin-Hua, et al.
Published: (1997) -
Fault-Tolerant Ring Embedding in Star Graphs
by: Chang Shu Hui, et al.
Published: (1995) -
Algorithm-Based Fault-Tolerant Strategies in Faulty Hypercube and Star Graph Multicomputers
by: Chen Yuh Shyan, et al.
Published: (1996)