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
Broadcast federation: an application-layer broadcast internetwork
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
IEEE Internet Computing
Improving Data Access in P2P Systems
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
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Implementing aggregation and broadcast over Distributed Hash Tables
ACM SIGCOMM Computer Communication Review
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Cost-effective broadcast for fully decentralized peer-to-peer networks
Computer Communications
Hi-index | 0.00 |
For the high scalability, DHT network becomes popular in P2P development in these few years. In comparing to flooding-based searching in unstructured P2P network, DHT network provides an efficient lookup. However, flooding still plays an important role in P2P systems. Some fundamental functions such as information collection, dissemination, or keyword searching can benefit from an efficient flooding mechanism. In this paper, we present a DHT network in which one flooding request generates O(N) messages where N is the system size. Moreover, our method considers message locality. Message forwarding across different autonomous systems are reduced significantly. Base on our flooding mechanism, information broadcasting and aggregation are fulfilled without much effort.