Sciweavers

625 search results - page 7 / 125
» Routing in Trees
Sort
View
121
Voted
DAC
2002
ACM
16 years 6 months ago
S-Tree: a technique for buffered routing tree synthesis
Milos Hrkic, John Lillis
153
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
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...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
155
Voted
ADHOCNOW
2005
Springer
15 years 10 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
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...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
121
Voted
EOR
2000
102views more  EOR 2000»
15 years 4 months ago
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
Anita Amberg, Wolfgang Domschke, Stefan Voß
ICNP
2002
IEEE
15 years 10 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
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...
Murali S. Kodialam, T. V. Lakshman