Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74917-2_16 | IWSOS |
Keywords | Field | DocType |
application predicate,multicast tree,reverse path forwarding construction,stochastic geometry,analysis drawing,delivery protocol,localising multicast | Protocol Independent Multicast,Source-specific multicast,Computer science,Xcast,Computer network,Reverse path forwarding,Pragmatic General Multicast,Distance Vector Multicast Routing Protocol,Multicast,Distributed computing,Scalability | Conference |
Volume | ISSN | ISBN |
4725 | 0302-9743 | 3-540-74916-0 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ian Wakeman | 1 | 436 | 129.40 |
| Stephen Cogdon | 2 | 0 | 0.34 |
| Laurent Mathy | 3 | 1047 | 92.14 |
| michael fry | 4 | 20 | 1.91 |