11 search results - page 1 / 3 » Depth-Latency Tradeoffs in Multicast Tree Algorithms |
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
COMCOM
2000
13 years 4 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
TWC
2010
12 years 11 months ago
2010
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
NGC
2001
Springer
13 years 9 months ago
2001
Springer
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing ...
NETGAMES
2003
ACM
13 years 10 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...