Reliability of network connectivity

Author

Obeidat, Ibrahim M. ; Berkovich, Simon Y.

Author_Institution

Dept of Comput. Sci., George Washington Univ., Washington, DC

fYear

2008

fDate

4-6 Aug. 2008

Firstpage

435

Lastpage

441

Abstract

One major benchmark of the network is to check its reliability. This can be completed by checking the graphs when the network is fully functioning but subject to failure. There is no known algorithm that can measure the reliability in a polynomial time, and hence measuring the reliability by means of simulation is a preferable choice. The goal of this paper is to check the network reliability, by means of simulation using different methods, first generating a network using the random graphs, and second generating a network using regular graphs. Within this paper, I will focus on the all-terminal problem in which a path between every pair of nodes is checked using the Union and Find method.

Keywords

computational complexity; computer network reliability; graph theory; all-terminal network problem; computer networks; network connectivity reliability; network failure; polynomial time; random graphs; regular graphs; union-and-find method; Communication networks; Computer network reliability; Computer networks; Computer science; Polynomials; Switches; Telecommunication network reliability; Time measurement; Web sites; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Applications of Digital Information and Web Technologies, 2008. ICADIWT 2008. First International Conference on the

Conference_Location

Ostrava

Print_ISBN

978-1-4244-2623-2

Electronic_ISBN

978-1-4244-2624-9

Type

conf

DOI

10.1109/ICADIWT.2008.4664388

Filename

4664388