Skip to Main content Skip to Navigation
Theses

Routage Efficace pour les Réseaux Pair-à-Pair utilisant des Tables de Hachage Distribuées

Abstract : This dissertation is a synthesis of our research at Orange Labs (formerly France Telecom R&D) to answer a problem identified by the aforesaid network operator and concerning peer-to-peer (P2P) streams. Commonly likened to file sharing, P2P has many applications. It corresponds to a changing world of software, networks and equipment. Beyond sharing, we are facing a real power (in terms of CPU, bandwidth, storage, etc.) available in a distributed manner. The rise of P2P requires new systems to meet the needs of users, but also those of ISPs and other network operators. The former seek permanently quite noticeable high quality of service (QoS). The latter aim to optimize the use of network resources (e.g. bandwidth) and to reduce various operations' and management costs (including those following the business agreements they signed with each others). Hence the interest of this thesis, that aims to let a P2P network be aware of its underlying IP network in order to achieve a system with an efficient routing mechanism that leads to a win-win situation. Our research focuses on systems based on distributed hash tables (DHT), that we study and analyze first. This dissertation begins with an analysis of the main protocols for discovery of dynamic resources in the different P2P architectures. The requirements for efficient P2P routing are then established. Afterwards, discovery techniques for generating and providing underlay network proximity information are presented, followed by techniques and main systems that exploit such information. Our research led to the definition, design, specification and both individual and comparative analysis of two systems: CAP (Context-Aware P2P system) and NETPOPPS (Network Provider Oriented P2P System). The former introduces semantics in the identifiers of peers and objects and is context-aware. The latter simplifies the management of the different identifiers and is network operator oriented: it enables cooperation between P2P traffic and the underlay's network operator (its policies and network topology).
Document type :
Theses
Complete list of metadatas

Cited literature [74 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/pastel-00521935
Contributor : Marguerite Fayçal <>
Submitted on : Wednesday, September 29, 2010 - 9:40:30 AM
Last modification on : Friday, July 31, 2020 - 10:44:09 AM
Long-term archiving on: : Friday, December 2, 2016 - 12:43:00 AM

Identifiers

  • HAL Id : pastel-00521935, version 1

Collections

Citation

Marguerite Fayçal. Routage Efficace pour les Réseaux Pair-à-Pair utilisant des Tables de Hachage Distribuées. Informatique et langage [cs.CL]. Télécom ParisTech, 2010. Français. ⟨pastel-00521935⟩

Share

Metrics

Record views

655

Files downloads

1369