Spanning tree approach in all-terminal network reliability expansion

Computer Communications

Volumn 24, Issue 13, 2001, Pages 1348-1353

  Fard, N ^a   Lee, Tae Han ^b  

^a Northeastern University   (United States)

^b IBM   (United States)

Author keywords

Degree matrix; Link; Network; Node; Reliability; Spanning tree

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); MATRIX ALGEBRA; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

ALL-TERMINAL NETWORK RELIABILITY EXPANSION; SPANNING TREE METHOD;

COMPUTER NETWORKS;

EID: 0035882233     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(01)00285-7     Document Type: Article

References (19)

1. An improved algorithm for network reliability
2. Topological layout of links for optimizing the s-t reliability in a computer communication system
3. Topological layout of links for optimizing the overall reliability in a computer communication System
4. Reliability allocation in a general system with non-identical components - A practical approach
5. A simple method for reliability evaluation of a communication system
6. A survey of network reliability and domination theory
7. Computational complexity of network reliability analysis: An overview
8. Network topology for maximizing the terminal reliability in a computer communication network
9. A model for addition of nodes to an existing computer network
10. On network augmentation
11. An efficient algorithm for computing global reliability of a network
12. Reliability improvement of multiterminal networks
13. Reliability polynomials and link importance in networks
14. An efficient method for reliability evaluation of a general network
15. Most vital edge of a graph with respect to spanning trees
16. Analysis and design of reliable computer networks