A new algorithm for network probabilistic connectivity

Author

Chen, Yubin ; Li, Jiandong ; Chen, Jiamo

Author_Institution

Sch. of Telecommun. Eng., Xidian Univ., Xi´´an, China

Volume

2

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

920

Abstract

A new algorithm for network probabilistic connectivity is presented. In this algorithm, the multi-step decomposition algorithm of the network states space is given. A new method to construct sub-graphs for the obtained events is proposed, which can greatly reduce the dimensions of network states space. An iterative computation is used to approximate lower bound of the value of the probabilistic connectivity. Compared with other algorithms, ours is characterized by its fast computing and converging speed, and is most suitable for approximating computation

Keywords

approximation theory; convergence of numerical methods; graph theory; iterative methods; probability; state-space methods; telecommunication network reliability; computation approximation; fast computing speed; fast convergence speed; iterative algorithm; iterative computation; lower bound approximation; multi-step decomposition algorithm; network probabilistic connectivity; network reliability; network states space; sub-graphs; undirected graph; Algorithm design and analysis; Computer networks; Equations; Iterative algorithms; Probability; State-space methods; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference Proceedings, 1999. MILCOM 1999. IEEE

Conference_Location

Atlantic City, NJ

Print_ISBN

0-7803-5538-5

Type

conf

DOI

10.1109/MILCOM.1999.821337

Filename

821337