625 search results - page 7 / 125 » Routing in Trees |
DAC
2002
ACM
15 years 11 months ago
2002
ACM
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
ADHOCNOW
2005
Springer
15 years 3 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
EOR
2000
14 years 9 months ago
2000
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
106
click to vote
ICNP
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...