3rd International ICST Conference on Collaborative Computing: Networking, Applications and Worksharin

Research Article

Message Replication in Unstructured Peer-to-Peer Network

  • @INPROCEEDINGS{10.1109/COLCOM.2007.4553853,
        author={Osama Al-Haj Hassan and Lakshmish Ramaswamy},
        title={Message Replication in Unstructured Peer-to-Peer Network},
        proceedings={3rd International ICST Conference on Collaborative Computing: Networking, Applications and Worksharin},
        publisher={IEEE},
        proceedings_a={COLLABORATECOM},
        year={2008},
        month={6},
        keywords={Peer to peer networks load balancing flooding Replication},
        doi={10.1109/COLCOM.2007.4553853}
    }
    
  • Osama Al-Haj Hassan
    Lakshmish Ramaswamy
    Year: 2008
    Message Replication in Unstructured Peer-to-Peer Network
    COLLABORATECOM
    IEEE
    DOI: 10.1109/COLCOM.2007.4553853
Osama Al-Haj Hassan1,*, Lakshmish Ramaswamy1,*
  • 1: Department of Computer Science, University of Georgia, Athens, GA 30602
*Contact email: osama80@uga.edu, laks@cs.uga.edu

Abstract

Recently, unstructured peer-to-peer (P2P) applications have become extremely popular. Searching in these networks has been a hot research topic. Flooding-based searching, which has been the basis of real-world P2P networks is inherently inefficient and unscalable. Replication has proven to be an effective strategy to improve efficiency and scalability of unstructured P2P networks. Previous research has largely focused on replicating resources or their references. This paper considers a replication solution from a different perspective; we investigate replicating messages and its effect on overloading problem. We propose two message replication strategies. The Distance-based message replication technique replicates the query messages at different topological regions of the network. The Landmarks-based technique further optimizes the performance by considering both the topology as well as the physical proximities of the peers of the overlay. Our experiments show that the proposed techniques substantially reduce the message traffic in the overlay while maintaining query performance.