Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
The complexity of the residual node connectedness reliability problem
SIAM Journal on Computing
Software-Based Rerouting for Fault-Tolerant Pipelined Communication
IEEE Transactions on Parallel and Distributed Systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
A Routing Methodology for Achieving Fault Tolerance in Direct Networks
IEEE Transactions on Computers
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and Tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
There exist a large number of graph optimization problems in the literature, which arise in network design and analysis. Our objective in this paper is to highlight the disconnection probability which can arise in interconnect networks of large-scale parallel processors systems. Although traditional measures of fault-tolerance such as reliability and availability are applicable to such systems, these measures were designed mostly for mission-oriented applications or repairable systems. They fail to account for the high redundancy levels typical in peer-to-peer (P2P) communication and distributed systems. For these systems, new measures have been introduced that can evaluate the capability of a system for graceful degradation. In the design of such systems, one of the most fundamental considerations is the reliability of their interconnected networks, which can be usually characterized by connectivity of the topological structure of the network. In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how static patterns of node failure affect the resilience of such networks. Simulation results based on the network topology confirm the validity of the analytical approximation and demonstrate the localizer efficiency.