Finding Good Partners in Availability-aware P2P Networks

Stevens Le Blond 1 Fabrice Le Fessant 2 Erwan Le Merrer 3
1 PLANETE - Protocols and applications for the Internet
Inria Grenoble - Rhône-Alpes, CRISAM - Inria Sophia Antipolis - Méditerranée
2 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
UR1 - Université de Rennes 1, Inria Saclay - Ile de France, INSA - Institut National des Sciences Appliquées, CNRS - Centre National de la Recherche Scientifique : UMR
3 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : We study the problem of finding peers matching a given availability pattern in a peer-to-peer (P2P) system. Motivated by practical examples, we specify two formal problems of availability matching that arise in real applications: disconnection matching, where peers look for partners expected to disconnect at the same time, and presence matching, where peers look for partners expected to be online simultaneously in the future. As a scalable and inexpensive solution, we propose to use epidemic protocols for topology management; we provide corresponding metrics for both matching problems. We evaluated this solution by simulating two P2P applications, task scheduling and file storage, over a new trace of the eDonkey network, the largest available with availability information. We first proved the existence of regularity patterns in the sessions of 14M peers over 27 days. We also showed that, using only 7 days of history, a simple predictor could select predictable peers and successfully predicted their online periods for the next week. Finally, simulations showed that our simple solution provided good partners fast enough to match the needs of both applications, and that consequently, these applications performed as efficiently at a much lower cost. We believe that this work will be useful for many P2P applications for which it has been shown that choosing good partners, based on their availability, drastically improves their performance and stability.
Type de document :
Communication dans un congrès
International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09), Nov 2009, Lyon, France. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00432741
Contributeur : Fabrice Le Fessant <>
Soumis le : mardi 17 novembre 2009 - 10:30:37
Dernière modification le : mercredi 2 août 2017 - 10:08:50
Document(s) archivé(s) le : jeudi 30 juin 2011 - 11:56:55

Fichier

sss2009.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00432741, version 1

Citation

Stevens Le Blond, Fabrice Le Fessant, Erwan Le Merrer. Finding Good Partners in Availability-aware P2P Networks. International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09), Nov 2009, Lyon, France. 2009. 〈inria-00432741〉

Partager

Métriques

Consultations de la notice

445

Téléchargements de fichiers

154