Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

INFOCOM
1991
IEEE

favoriteEmaildiscussreport

120views Communications» more INFOCOM 1991»

On Multicast Path Finding Algorithms

14 years 2 months ago

On Multicast Path Finding Algorithms

Download cs.uccs.edu

We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show that the heuristic algorithms can find multicast paths whose costs are close to optimal and can operate with reasonable response time for large networks. We discuss applications of these path finding algorithms to set up multipoint connections.

Ching-Hua Chow

Real-time Traffic

Communications | Heuristic Algorithms | INFOCOM 1991 | Multicast Paths | Path Finding Algorithms |

claim paper

Related Content

» Control Mechanism for QoS Guaranteed Multicast Service in OVPN over IPGMPLS over DWDM

» The New Shortest Best Path Tree SBPT Algorithm for Dynamic Multicast Trees

» Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution

» A Genetic Algorithms Based Approach for Group Multicast Routing

» A Heuristic Algorithm for the Multiconstrained Multicast Tree

» CRMA A Cyclebreaking Multicast Routing Algorithm for Supporting QoS over the Internet

» Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup

» Improving Multicast Tree Construction in Static Ad Hoc Networks

» An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	INFOCOM
Authors	Ching-Hua Chow

Comments (0)