Scoped broadcast in structured P2P networks

Authors:
Min-Yen Lue;Chung-Ta King;Ho Fang
Affiliations:
National Tsing Hua University, Hsinchu, Taiwan;National Tsing Hua University, Hsinchu, Taiwan;National Tsing Hua University, Hsinchu, Taiwan
Venue:
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Year:
2006

Citing 7
Cited 2

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mapping the Gnutella Network

IEEE Internet Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Robust Aggregation Protocols for Large-Scale Overlay Networks

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Tornado: a capability-aware peer-to-peer storage overlay

Journal of Parallel and Distributed Computing - Special issue on middleware
Implementing aggregation and broadcast over Distributed Hash Tables

ACM SIGCOMM Computer Communication Review

Management of peer-to-peer overlays

International Journal of Internet Protocol Technology
P2P Networking and Applications

P2P Networking and Applications

Quantified Score

Hi-index	0.00

Visualization

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.