Javier Faulin Angel A. Juan Carles Serrat Vicente Bargueno
Abstract
The design of reliable networks is a fundamental task for system managers and telecommunication engineers, since reliability and availability are strongly related to other important concepts, such as quality and security. We have developed some simulation-based algorithms, implemented as C/C++ programs that can be used to obtain information about reliability and availability levels in a network. They can also be used to identify those critical components that should be improved or duplicated in order to increase overall reliability or availability. Furthermore, a procedure to obtain all minimal paths connecting a set of nodes in a network is introduced. Finally, two application examples, regarding Wide Area Networks (WANs), are discussed using these algorithms and procedure. [Received 22 July 2006; Revised 17 October; Accepted 26 October 2006].
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.