Main Reference PaperOn Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks, IEEE Transactions on Parallel and Distributed Systems, May 2012
  • P2P applications are popular because they primarily provide low entry barriers and self-scaling. Object search is an essential building block in several P2P applications. The project proposes a novel overlay formation algorithm for unstructured P2P networks. Based on the file sharing pattern exhibiting the power-law property, the proposal is unique in that it poses rigorous performance guarantees.

+ Description
  • P2P applications are popular because they primarily provide low entry barriers and self-scaling. Object search is an essential building block in several P2P applications. The project proposes a novel overlay formation algorithm for unstructured P2P networks. Based on the file sharing pattern exhibiting the power-law property, the proposal is unique in that it poses rigorous performance guarantees.

  • To present an unstructured P2P network with rigorous performance guarantees to enhance search efficiency and effectiveness
    » To progressively and effectively exploit the similarity of the peers by using query messages
    » To clearly outperform other techniques in terms of
    1. the query message hop count
    2. the successful ratio of resolving a query
    3. the query traffic overheadM
    4. the overlay maintenance overhead.

+ Aim & Objectives
  • To present an unstructured P2P network with rigorous performance guarantees to enhance search efficiency and effectiveness
    » To progressively and effectively exploit the similarity of the peers by using query messages
    » To clearly outperform other techniques in terms of
    1. the query message hop count
    2. the successful ratio of resolving a query
    3. the query traffic overheadM
    4. the overlay maintenance overhead.

  • The project proposes an overlay construction algorithm in which any given unstructured P2P network G (V, E), where V is the set of participating peers, and E is the set of overlay connections linking the peers in V. The peers in G may be interconnected randomly. The goal is to restructure G with the following properties,
    1. High Clustering,
    2. Low Diameter,
    3. Progressive.

+ Contribution
  • The project proposes an overlay construction algorithm in which any given unstructured P2P network G (V, E), where V is the set of participating peers, and E is the set of overlay connections linking the peers in V. The peers in G may be interconnected randomly. The goal is to restructure G with the following properties,
    1. High Clustering,
    2. Low Diameter,
    3. Progressive.

  • Java JDK 1.8, MySQL 5.5.40

  • J2SE, Java Swing

+ Software Tools & Technologies
  • Java JDK 1.8, MySQL 5.5.40

  • J2SE, Java Swing

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.