DocumentCode
1651377
Title
1-fault tolerant design for token rings
Author
Wang, Jeng-Jung ; Hung, Chun-Nan ; Hsu, Lih-Hsing
Author_Institution
Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear
1998
Firstpage
481
Lastpage
483
Abstract
In this paper, we present a family of S-regular, planar, and Hamiltonian graphs. Any graph in this family remains Hamiltonian if any node or any edge is deleted. Moreover, the diameter of any graph in this family is O(√p) where p is the number of nodes
Keywords
fault tolerant computing; token networks; 1-fault tolerant design; Hamiltonian graphs; S-regular graphs; token rings; Computer architecture; Computer networks; Concurrent computing; Contracts; Councils; IEL; Information science; Multiprocessor interconnection networks; Network topology; Token networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Networking, 1998. (ICOIN-12) Proceedings., Twelfth International Conference on
Conference_Location
Tokyo
Print_ISBN
0-8186-7225-0
Type
conf
DOI
10.1109/ICOIN.1998.648431
Filename
648431
Link To Document