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
Internet Indirection Infrastructure
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Implementing aggregation and broadcast over Distributed Hash Tables
ACM SIGCOMM Computer Communication Review
Ivy: a read/write peer-to-peer file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Operating system support for planetary-scale network services
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
| Hi-index | 0.00 |
Broadcast is a basic service for many network operations. It had been proposed to maintain a broadcast tree over a P2P network explicitly to support message broadcast from the root to leaves and information aggregation from leaves to the root reversely. We notice that a peer near the root of a broadcast tree has shorter message latency and a smaller possibility of message loss due to join or departure of any peers in the path from itself to the root; however, it has to contribute CPU power and network bandwidth to forward or aggregate messages. On the other hand, a leaf peer does not have to forward messages; however, it suffers from longer message latency and a larger possibility of message loss. A P2P network can maintain multiple broadcast trees to improve fairness. In such a scenario, a peer near the root of one broadcast tree is probably a leaf of another tree. In this paper, a redirection mechanism, referred to as ABS, is used when multiple broadcast trees are maintained. Simulation results show that ABS further balances the load of peers and significantly reduces the minimal hop counts of intermediate peers that a broadcast message has to pass through before it arrives at a peer.