Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Choosing partners based on availability in P2P networks

Choosing partners based on availability in P2P networks Choosing Partners Based on Availability in P2P Networks STEVENS LE BLOND, INRIA Sophia Antipolis/INRIA Rhône-Alpes FABRICE LE FESSANT, INRIA Saclay - Ile de France ERWAN LE MERRER, Technicolor Availability of applications or devices is known to be one of the most critical variables impacting the performances of software systems. We study in this article the problem of nding 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 le storage, over a new trace of the eDonkey network, the largest one with availability information. We rst 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Autonomous and Adaptive Systems (TAAS) Association for Computing Machinery

Choosing partners based on availability in P2P networks

Download PDF
14 pages

Loading next page...
 
/lp/association-for-computing-machinery/choosing-partners-based-on-availability-in-p2p-networks-g1Ok2ng5kF

References (33)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2012 by ACM Inc.
ISSN
1556-4665
DOI
10.1145/2240166.2240175
Publisher site
See Article on Publisher Site

Abstract

Choosing Partners Based on Availability in P2P Networks STEVENS LE BLOND, INRIA Sophia Antipolis/INRIA Rhône-Alpes FABRICE LE FESSANT, INRIA Saclay - Ile de France ERWAN LE MERRER, Technicolor Availability of applications or devices is known to be one of the most critical variables impacting the performances of software systems. We study in this article the problem of nding 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 le storage, over a new trace of the eDonkey network, the largest one with availability information. We rst 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

Journal

ACM Transactions on Autonomous and Adaptive Systems (TAAS) – Association for Computing Machinery

Published: Jul 1, 2012

There are no references for this article.