Sciweavers

474 search results - page 5 / 95
» On Multicast Path Finding Algorithms
Sort
View
LCN
2008
IEEE
14 years 2 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...
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 2 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
INFOCOM
2005
IEEE
14 years 1 months ago
Measurement-based multipath multicast
Abstract— We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are establishe...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
EUROMICRO
2007
IEEE
14 years 1 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...
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki