How to find biconnected components in distributed networks
Journal of Parallel and Distributed Computing
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Dependability: Basic Concepts and Terminology
Dependability: Basic Concepts and Terminology
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Latency-Driven Replica Placement
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Farsite: federated, available, and reliable storage for an incompletely trusted environment
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Symbolic Reliability Analysis of Self-healing Networked Embedded Systems
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
| Hi-index | 0.00 |
Application details uncertain at design time as well as tolerance against permanent resource defects demand flexibility and redundancy. In this context, we present a strategy for placing replicas in embedded point-to-point networks where link as well as node defects may occur at runtime. The proposed strategies for replica placement are based on the partitioning of the network into biconnected components. We are able to distinguish between different replication strategies, i.e., active and passive replication. Our experimental results show that the reliability improvement due to the proposed replica placement strategies is up to 23% compared to a randomized strategy.