Object Location Schemes in P2P Networks

Sponsor

 Mostafa Ammar
(ammar@cc.gatech.edu)

Area

Networking and Telecommunication

Problem

The peer-to-peer (P2P) file sharing systems such as Napster, Gnutella, etc., have become quite popular through the past several years. While the P2P systems have a rich set of features such as decentralized control, high redundancy, high data availability, and so on. The essential operation in such systems is to locate the data object. As the increasing of the P2P networks scale, object location in such networks has become a critical problem.  Locating schemes in P2P networks have seen an evoluation from centralized server lookup to decentralized approach to hash based indexing scheme, in pursuit of better scalability. 

This project involves an extensive survey of existing techniques for object location in P2P networks. The major goal of this project is to get familiar with the underlying schemes for P2P networks, the concept of overlay networks, and network protocol design. Here is what I will do in this mini project:

1. Get familiar with  several popular P2P file sharing systems, and understand how do they implement the data sharing operations. 

2. Survey the existing data object location schemes for current P2P networks, and categorize them into several classes based on certain criteria, and analyze the major shortcomings and advantages of such schemes.

      3. Give a short description of my design of object location scheme, and analyze the advantages comparing with existing solutions.

Deliverables

  • A report which is composed of the survey of existing research, and the design of an object location scheme.