Sciweavers

100 search results - page 4 / 20
» Least Cost Multicast Spanning Tree Algorithm for Local Compu...
Sort
View
INFOCOM
1996
IEEE
13 years 11 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
HICSS
2003
IEEE
183views Biometrics» more  HICSS 2003»
14 years 24 days ago
CRMA: A Cycle-breaking Multicast Routing Algorithm for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
NETGAMES
2003
ACM
14 years 22 days ago
Priority-based distribution trees for application-level multicast
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 ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
LCN
2008
IEEE
14 years 1 months ago
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
Fen Zhou, Miklós Molnár, Bernard Cou...
CCIA
2005
Springer
13 years 9 months ago
Multi-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
Diego Pinto, Benjamín Barán, Ram&oac...