A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An Overlay Tree Building Control Protocol
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
End-Host Multicast Communication Using Switch-Trees Protocols
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spatial queries in sensor networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
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
The impact of heterogeneous bandwidth constraints on DHT-Based multicast protocols
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we investigate how to incorporate an application metric into the construction of a multicast tree so as to facilitate the use of range constrained multicast. We first describe the construction and delivery protocols, show through an analysis drawing on stochastic geometry that the protocol is scalable, and provide simulations showing the performance of the protocol against trees derived from reverse path forwarding construction.