Article ID: | iaor2008138 |
Country: | United Kingdom |
Volume: | 35 |
Issue: | 6 |
Start Page Number: | 659 |
End Page Number: | 670 |
Publication Date: | Dec 2007 |
Journal: | OMEGA |
Authors: | Cancela Hctor, Petingi Louis |
Keywords: | communications, networks, graphs |
Given the pervasive nature of computer and communication networks, many paradigms have been used to study their properties and performances. In particular, reliability models based on topological properties can adequately represent the network capacity to survive failures of its components. Classical reliability models are based on the existence of end-to-end paths between network nodes, not taking into account the length of these paths; for many applications, this is inadequate, because the connection will only be established or attain the required quality if the distance between the connecting nodes does not exceed a given value. An alternative topological reliability model is the diameter-constrained reliability of a network; this measure considers not only the underlying topology, but also imposes a bound on the diameter, which is the maximum distance between the nodes of the network. In this work, we study in particular the case where we want to model the connection between a source-vertex