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

Computer Communications

Volumn 25, Issue 8, 2002, Pages 825-833

  Sheu, Pi Rong ^a   Chen, Shan Tai ^a  

^a NATIONAL YUNLIN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Delay variation; End to end delay; Heuristic algorithm; Multicast communications; Time complexity

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; REAL TIME SYSTEMS;

DELAY VARIATION MULTICAST ALGORITHMS (DVMA);

MULTICASTING;

EID: 0037093561     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(01)00404-2     Document Type: Article

References (12)

1. Core based tree (CBT) multicast routing architecture
2. A note on two problems in connexion with graphs
3. Steiner's problem in graphs and its implications
4. Routing to multiple destinations in computer networks
5. Reducibility among combinatorial problems
6. A fast algorithm for steiner trees
7. Shortest connection networks and some generalizations
8. Multicast routing with end-to-end delay and delay variation constraints
9. On the hardness of approximating the delay variation constraint multicast trees
10. Routing of multipoint connections