Optimal k-Fault-Tolerant Networks for Token Rings
博士 === 國立交通大學 === 資訊科學系 === 87 === Designing an optimal k-fault-tolerant network for token rings is equivalent to constructing an optimal k-hamiltonian graph, where k is a positive integer and corresponds to the number of faults. A graph G = (V, E) is k-hamiltonian i...
Main Authors: | Chun-Nan Hung, 洪春男 |
---|---|
Other Authors: | Lih-Hsing Hsu |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/17481949313611466953 |
Similar Items
-
Optimal k-Fault-Tolerant Networks for Token Rings
by: Hung, Wei-Jiunn, et al.
Published: (1996) -
Optimal k-Fault-Tolerant Networks for Token Rings
by: Ya-Hui Liu, et al.
Published: (1999) -
Fault tolerant and integrated token ring network
by: Gilbar, Thomas Christopher
Published: (1993) -
Fault Tolerant Token Ring Embedding in Double Loop Networks
by: Lin, Chun-Yuan, et al.
Published: (1997) -
Analyses of asymmetric prioritized token ring and interconnection of token ring networks
by: Gréla-M'Poko, Bruno
Published: (1989)