Sciweavers

19 search results - page 2 / 4
» A routing algorithm for dynamic multicast trees with end-to-...
Sort
View
MMB
2004
Springer
13 years 10 months ago
SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis
Ever-increasing attention has been drawn to source specific multicast in the Internet society. In this paper, a novel multicast scheme, called Scalable Recursive Explicit Multicast...
Yewen Cao, Khalid Al-Begain
INFOCOM
1999
IEEE
13 years 9 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
EUROMICRO
2007
IEEE
13 years 11 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
COMCOM
1998
106views more  COMCOM 1998»
13 years 4 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
13 years 11 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak