The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Finding Close Friends on the Internet
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A location-aware peer-to-peer overlay network: Research Articles
International Journal of Communication Systems
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Application Layer Multicast (ALM) is considered as an alternative approach to IP multicast. Topology awareness is an important metric for ALM because it reduces link stress and delay stretch considerably. This work describes a novel, stable and low overhead ALM approach using binning technique to cluster nearby receivers, referred to as Bincast. Bincast uses a constant number of landmarks to cluster nearby nodes. It then constructs a k-ary tree between cluster members. The most stable node is selected as the local header in each cluster. It monitors cluster membership events and decides to split or merge the cluster if necessary. Detailed performance evaluation revealed that Bincast has lower delay stretch than similar methods with approximately same stress.