DocumentCode
476363
Title
Fault Diameter of Even Networks
Author
Kim, Jong-Seok ; Kim, Sung Won ; Lee, Hyeong-Ok
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Yeungnam Univ., Gyeongsan
Volume
1
fYear
2008
fDate
2-4 Sept. 2008
Firstpage
406
Lastpage
411
Abstract
A. Ghafoor proposed even networks as a class of fault-tolerant multiprocessor networks in (A. Ghafoor, 1989) and analyzed so many useful properties include node-disjoint paths. By introducing node-disjoint paths, fault diameter of even networks can be d + 2 (d=odd) or d + 3 (d=even). However, the lengths of node-disjoint paths are not the shortest. In this paper, we show that even networks are node- and edge- symmetric.We also propose the shortest lengths of node-disjoint paths, and show that fault diameter of even networks is d + 1.
Keywords
fault tolerant computing; multiprocessor interconnection networks; even networks; fault diameter; fault-tolerant multiprocessor networks; interconnection network; node-disjoint paths; Algorithm design and analysis; Computer networks; Computer science; Computer science education; Costs; Fault tolerance; Information analysis; Information management; Multiprocessor interconnection networks; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Networked Computing and Advanced Information Management, 2008. NCM '08. Fourth International Conference on
Conference_Location
Gyeongju
Print_ISBN
978-0-7695-3322-3
Type
conf
DOI
10.1109/NCM.2008.22
Filename
4624041
Link To Document