Sciweavers

474 search results - page 3 / 95
» On Multicast Path Finding Algorithms
Sort
View
ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
13 years 11 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin
IPPS
2002
IEEE
14 years 16 days ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
COMCOM
2004
92views more  COMCOM 2004»
13 years 7 months ago
Genetic algorithms for multiple multicast on WDM ring network
The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical networ...
Der-Rong Din
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
14 years 26 days ago
Congestion-Aware Multicast Routing 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 ...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 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