Terminal pair reliability of tree-type computer communication networks

Author

Yang, Oliver W W

Author_Institution

Dept. of Electr. Eng., Ottawa Univ., Ont., Canada

fYear

1991

fDate

4-7 Nov 1991

Firstpage

905

Abstract

An analysis is presented for computing the terminal pair reliabilities of the two-centered tree (2CT), the X-tree (XT), and the ring-tree (RT). A building block is identified in the 2CT, from which a decomposition algorithm is formulated. Another building block is identified for the XT and RT from which a truss-transformation method and a computational algorithm are obtained. By comparison, it is shown that an XT is a good candidate for applications such as high bandwidth networks with high link reliability

Keywords

computer networks; reliability; X-tree; building block; computational algorithm; computer communication networks; decomposition algorithm; high bandwidth networks; high link reliability; ring-tree; terminal pair reliabilities; tree type networks; truss-transformation method; two-centered tree; Algorithm design and analysis; Bandwidth; Binary trees; Communication networks; Computer applications; Computer network reliability; Computer networks; Network topology; Telecommunication network reliability; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1991. MILCOM '91, Conference Record, Military Communications in a Changing World., IEEE

Conference_Location

McLean, VA

Print_ISBN

0-87942-691-8

Type

conf

DOI

10.1109/MILCOM.1991.258397

Filename

258397