DocumentCode
1383955
Title
The minimum distance diagram of double-loop networks
Author
Chiuyuan Chen ; Hwang, F.K. ; Hsien-Sheng Hsiao ; Wei-Pang Yang
Author_Institution
Dept. of Appl. Math., Nat. Chiao Tung Univ., Hsinchu
Volume
49
Issue
9
fYear
2000
fDate
9/1/2000 12:00:00 AM
Firstpage
977
Lastpage
979
Abstract
It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation
Keywords
computational geometry; graph theory; Spanish dissertation; double-loop networks; minimum distance diagram; necessary and sufficient conditions; Aerospace control; Computer Society; Delay; Fault detection; Fault diagnosis; Fault tolerant systems; Network topology; Protocols; Relays; Senior members;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.869331
Filename
869331
Link To Document