Peer-to-Peer Applications Beyond File Sharing: Overlay Network Requirements and Solutions

In this paper we analyze the functional and non-functional requirements of peer-to-peer (P2P) systems that go beyond the needs of the well explored file-sharing P2P systems. Four basic subcategories are suggested to classify the non-functional requirements: adaptability, efficiency, validity and trust. Similarly, the functional requirements are divided into user-triggered and system-triggered functions. Then, we present and discuss several existing solutions following different design approaches in order to reveal their suitability for different types of P2P applications. More particularly, we capture the characteristics of structured and unstructured overlay networks. For the structured solutions, we investigate distributed hash tables and lexicographic graph based solutions. For the unstructured approaches, we discuss both hierarchical and non-hierarchical overlay networks and emphasize on small-world and power-law networks. Finally, we provide a set of demanding application classes such as voice over IP and massive multiplayer online games that may be benefited by utilizing the P2P technology.

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

2006
Article

Résumé

Official source

https://infoscience.epfl.ch/record/113569?ln=fr

À propos de ce résultat

Concepts associés (13)

Concepts associés

Chargement

Publications associées (16)

Chargement

Afficher plus

Publications associées

Chargement

Pair-à-pair

Le pair-à-pair ou système pair à pair (en anglais peer-to-peer, souvent abrégé « P2P ») est un modèle d'échange en réseau où chaque entité est à la fois client et serveur, contrairement au modèle c

Informations non structurées

Les informations non structurées ou données non structurées sont des données représentées ou stockées sans format prédéfini. Ces informations sont toujours destinées à des humains. Elles sont typique

Partage de fichiers

Le partage de fichiers est une technique de transfert de fichier consistant à distribuer ou à donner accès, à distance, à des données numériques à travers un réseau informatique. Il peut s'agir de f

Advanced Peer-to-Peer Networking: The P-Grid System and its Applications

Karl Aberer, Philippe Cudré-Mauroux, Anwitaman Datta, Zoran Despotovic, Manfred Hauswirth, Roman Schmidt, Jie Wu

The limitations of client/server systems become evident in an Internet-scale distributed environment. Peer-topeer (P2P) systems offer an interesting alternative to traditional client/server systems: Every node acts both as a client and a server and “pays” its participation by providing access to its computing resources. Systems such as Napster and Gnutella have proven their practical applicability. In this article we give an overview of our PGrid system which provides an advanced P2P infrastructure targeted at application domains beyond mere filesharing. We present the conceptual foundations and outline some of the applications we are developing at the moment.

2003

Chargement

Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

Karl Aberer, Fabius Klemm

There has been an increasing research interest in developing full-text retrieval based on peer-to-peer (P2P) technology. So far, these research efforts have largely concentrated on efficiently distributing an index. However, ranking of the results retrieved from the index is a crucial part in information retrieval. To determine the relevance of a document to a query, ranking algorithms use collection-wide statistics. Term frequency - inverse document frequency (TFIDF), for example, is based on frequencies of documents containing a given term in the whole collection. Such global frequencies are not readily available in a distributed system. In this paper, we study the feasibility of aggregating global frequencies for a large term vocabulary in a P2P setting. We use a distributed hash table (DHT) for our analysis. Traditional applications of DHTs, such as file sharing, index keys in the order of tens of thousands. Aggregation of a vocabulary consisting of millions of terms poses extreme requirements to a DHT implementation. We study different aggregation strategies and propose optimizations to DHTs to efficiently process large numbers of keys.

2005

Chargement

Analysis of peer-to-peer file dissemination

Jochen Mundinger

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much attention has been given to peer-to-peer (P2P) systems such as BitTorrent, Slurpie, SplitStream, Bullet and Avalanche. The key idea is that the file is divided into M parts of equal size and that a given user may download any one of these -- or, for Avalanche, linear combinations of these -- either from the server or from a peer who has previously downloaded it. However, performance analysis of P2P systems for file dissemination has typically been limited to comparing one system relative to another and typically been realized by means of simulations and measurements. We give the minimal time to fully disseminate the file of M parts from a server to N end users in a centralized scenario. In the scheduling literature this completion time is referred to as makespan. We thereby provide a lower bound which can be used as a performance benchmark for any P2P file dissemination system. We also investigate the part of the loss in efficiency that is due to the lack of centralized control in practice. Using simulation as well as direct computation, we show that even a simple and natural randomized strategy disseminates the file in an expected time that grows with N in a similar manner to the minimal time achieved with a centralized controller. This suggests that the performance of necessarily decentralized P2P file dissemination systems should still be close to our performance bound.

2006

Chargement

Afficher plus