Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Wakeman, I., Cogdon, S., Mathy, L., & Fry, M. (2007). Localising multicast using application predicates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4725 LNCS, pp. 193–207). Springer Verlag. https://doi.org/10.1007/978-3-540-74917-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
