Fault-Tolerant Routing for P2P Systems with Unstructured Topology

Authors:
Leonardo Mariani
Affiliations:
Universita degli Studi di Milano Bicocca, Italy
Venue:
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Year:
2005

Citing 0
Cited 2

Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Stochastic analysis of graph transformation systems: a case study in P2P networks

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

New application scenarios, such as Internet-scale computations, nomadic networks and mobile systems, require decentralized, scalable and open infrastructures. The peer-to-peer (P2P) paradigm has been recently proposed to address the construction of completely decentralized systems for the above mentioned environments, but P2P systems frequently lack of dependability. In this paper, we propose an algorithm for increasing fault-tolerance by dynamically adding redundant links to P2P systems with unstructured topology. The algorithm requires only local interactions, is executed asynchronously by each peer and guarantees that the disappearance of any single peer does not affect the overall performance and routing capabilities of the system.