FICHE MODULE SI5 / M2 IFI

TITRE : Peer-to-peer

DUREE  : 16 semaines (évaluation comprise)

RESPONSABLE  : (1 ligne) Arnaud LEGOUT
QUALITE/CV : (3 lignes) Research scientist INRIA

Un seul responsable par cours

AUTRES INTERVENANTS ACADEMIQUES (Nom / Etablissement) :

• Olivier DALLE (MCF, Université de Nice - Sophia Antipolis)
• Luigi LIQUORI (INRIA)

AUTRES INTERVENANTS EN ENTREPRISE (Nom / Entreprise) :

RESUME (5 lignes) : Since the early days of the internet, from the email to the Web, the client-server architecture has been used for data transfer. However, in a few years, the peer-to-peer architecture has changed our way to share information. At the present time, peer-to-peer communications account for between 60% to 90% of the internet traffic. The peer-to-peer architecture deployment has followed a rare model in the history of the internet. Whereas, most of the time, even the smallest improvement requires years of academic evaluations and experimentations, before a real large scale deployment, peer-to-peer systems were deployed at large scale based on an empirical process. The understanding of these new systems is fundamental today for anybody who wants to work in an area related to networking.

OBJECTIFS (2 lignes) : Get the fondations to understand P2P systems and to work autonomously on such systems.

CONTENU (1 ligne par séance si possible au format [Titre ] [Nature (C / TD / TP)] [Durée] [Intervenant] ) : 

• Part 1: P2P localization
  1. Introduction / Unstructured Localization (C: 3h, Dalle)
  2. Analysis/comparison of unstructured protocols: Gnutella, Kazaa, Edonkey2k, flooding, incremental search, super peers, ... (TD: 4h, Liquori)
  3. DHT: CAN, Chord, Pastry (C: 3h, Dalle)
  4. Case study analysis of DHT (TD: 4h, Dalle/Perennes)
  5. Publish/Subscribe & semantic search (C: 3h, Liquori)
  6. Pub/sub analysis & comparison (TD: 4h, Liquori)
• Part 2: P2P content replication
  1. P2P content replication Overview: Definitions, popularity of P2P applications, P2P efficiency with deterministic models (C: 3h Legout)
  2. P2P content replication techniques: parallel download, piece and peer selection strategies(C: 3h Legout)
  3. BitTorrent protocol and algorithms overview (C: 3h Legout)
  4. BitTorrent evaluation: torrent life, piece selection strategy(C: 3h Legout)
  5. BitTorrent evaluation: peer selections strategy, fairness issues, robustness and incentives (C: 3h Legout)
  6. Advanced issues (TD: 4h Legout)
• Part 3: P2P applications (In this part, each subject will be illustrated by a research article that will be discussed with one expert of the field.)
  1. P2P file systems (TD: 4 hours, Dalle)
  2. P2P file storage and redundancy (TD: 4 hours, Dalle)
  3. Hole Punching (TD: 4 hours, Legout)

PREREQUIS :

• General course on networking (IP/TCP/routing/Internet architecture)

BIBLIOGRAPHIE :

• X. Yang and G. de Veciana “Service Capacity of Peer to Peer Networks”. IEEE Infocom’04
• J. H. Saltzer, D. P. Reed, and D. D. Clark “End-to-end arguments in system design”. ACM Transactions on Computer Systems 2, 4 (November 1984) pages 277-288
• P. Rodriguez, E. W. Biersack “Dynamic Parallel Access to Replicated Content in the Internet”. IEEE/ACM Transactions on Networking, August 2002(Also in IEEE/Infocom 2000)
• Bram Cohen, “Incentives Build Robustness in BitTorrent”, May 2003
• Stoica et al. “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications” ACM SIGCOMM’01
• Maymounkov and Mazières ―Kademlia: A peer-to-peer Information System Based on the XOR Metric‖
  Gummadi et al. “The Impact of DHT Routing Geometry on Resilience Proximity”
• A. Legout, G. Urvoy-Keller, and P. Michiardi “Rarest First and Choke Algorithms Are Enough”. In Proc. of ACM SIGCOMM/USENIX IMC'2006, Rio de Janeiro, Brazil, October 2006.
• A. Legout, N. Liogkas, E. Kohler, and L. Zhang “Clustering and Sharing Incentives in BitTorrent Systems”. Technical Report (inria-00112066, version 1 -21 November 2006), INRIA, Sophia Antipolis, November 2006.
  Extracting Guarantees from Chaos, John D. Kubiatowicz. Appears in Communications of the ACM, Vol 46, No. 2, February 2003
• J-M. Busca, F. Picconi, P. Sens. Pastis: a Highly-Scalable Multi-User Peer-to-Peer File System. EuroPar 2005, Lisboa, Portugal, September 2005. LNCS.
• Pond: the OceanStore Prototype, Sean Rhea, Patrick Eaton, Dennis Geels, Hakim Weatherspoon, Ben Zhao, and John Kubiatowicz. Appears in Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST '03), March 2003
• Peer-to-Peer Communication Across Network Address Translators, Bryan Ford, Pyda Srisuresh, and Dan Kegel. USENIX 2005.

SUPPORT de COURS :

MODE D’EVALUATION :

Quelque soit la langue du cours, c'est l'étudiant qui choisi la langue dans laquelle il sera évalué. La rédaction du sujet est dans la langue du cours (un cours en français aura un sujet en français, un cours en anglais aura un sujet en anglais).

Mettre une croix dans le mode d'évaluation choisi