A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Pi-Rong Sheu; Shan-Tai Chen

doi:10.1016/s0140-3664(01)00404-2

ScienceGate Book Chapters

JOURNAL ARTICLE

A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Pi-Rong Sheu Shan-Tai Chen

Year: 2002 Journal: Computer Communications Vol: 25 (8)Pages: 825-833 Publisher: Elsevier BV

DOI: 10.1016/s0140-3664(01)00404-2

Get Full-Text PDF Get Analytical Report

Keywords:

Multicast Computer science Xcast Source-specific multicast Computer network Pragmatic General Multicast Protocol Independent Multicast Heuristic Node (physics) Inter-domain Distributed computing Distance Vector Multicast Routing Protocol Tree (set theory) Variation (astronomy) Algorithm Mathematics

Metrics

Cited By

2.33

FWCI (Field Weighted Citation Impact)

Refs

0.90

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Network Traffic and Congestion Control

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Wireless Network Optimization

Physical Sciences → Engineering → Electrical and Electronic Engineering

Mobile Ad Hoc Networks

Physical Sciences → Computer Science → Computer Networks and Communications

A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Metrics

Citation History

Topics

Related Documents

A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem

Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

A heuristic algorithm for delay delay-variation bounded least cost multicast routing

Constructing Delay-bounded Multicast Tree with Optimal Delay Variation

Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation