1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management

Research Article

Scoped broadcast in structured P2P networks

  • @INPROCEEDINGS{10.1145/1146847.1146899,
        author={Min-Yen  Lue and Chung-Ta  King and Ho  Fang},
        title={Scoped broadcast in structured P2P networks},
        proceedings={1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management},
        publisher={ACM},
        proceedings_a={P2PIM},
        year={2006},
        month={6},
        keywords={peer-to-peer networking cardinality topology distributed hash table scoped broadcast},
        doi={10.1145/1146847.1146899}
    }
    
  • Min-Yen Lue
    Chung-Ta King
    Ho Fang
    Year: 2006
    Scoped broadcast in structured P2P networks
    P2PIM
    ACM
    DOI: 10.1145/1146847.1146899
Min-Yen Lue1,*, Chung-Ta King1,*, Ho Fang2,3,*
  • 1: Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan
  • 2: Institute of Information Systems and Applications, National Tsing Hua University
  • 3: Hsinchu, Taiwan
*Contact email: u881515@alumni.nthu.edu.tw, king@cs.nthu.edu.tw, hofang@pads1.cs.nthu.edu.tw

Abstract

DHT-based structured P2P networks have difficulties in supporting complex queries due to the use of hashing. A work around is to use flooding, as in unstructured P2P networks, to disseminate the queries. The question is how to reach a sufficient number of nodes so that the query may be answered. A k-node scoped broadcast is a broadcast operation that reaches at least k nodes. It can be controlled by setting an appropriate TTL value. Because of the dynamic nature of P2P networks, the TTL value must be chosen carefully to reach at least k nodes while keeping the number of messages to a minimum. In this paper, we investigate ways of performing k-node scoped broadcast in DHT-based P2P networks. We evaluate our approaches through simulations.