On finding feasible solutions for the delay constrained group multicast routing problem

IEEE Transactions on Computers

Volumn 51, Issue 5, 2002, Pages 581-588

  Low, Chor Ping ^a,b   Song, Xueyan ^b  

^a IEEE   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Delay constrained group multicast routing; Feasible solutions; Heuristic algorithm; NP completeness

Indexed keywords

DELAY CONSTRAINED GROUP MULTICAST ROUTING PROBLEM; GROUP MULTICASTING; HEURISTIC ALGORITHM; MULTICAST TREES;

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; PROBABILITY; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

MULTICASTING;

EID: 0036566479     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2002.1004596     Document Type: Article

References (17)

1. Core Based Trees (CBT)
2. Distributed algorithms for multicast path setup in data networks
3. A note on two problems in connection with graphs
4. Group multicast routing algorithm by using multiple minimum steiner trees
5. Reducibility among combinatorial problems
6. Multicast routing for multimedia communication
7. A fast algorithm for steiner trees
8. An efficient algorithm for group multicast routing with bandwidth reservation
9. An iterative algorithm for delay-constrained minimum cost multicasting
10. On finding steiner vertices
11. Evaluation of multicast routing algorithms for real-time communication on high-speed networks
12. Efficient multicast routing for delay-sensitive applications
13. An approximate solution for the steiner problem in graphs
14. On finding feasible solutions to the group multicast routing problem
15. Routing of multipoint connections
16. A survey on multicast routing and its QoS extension: Problems, Algorithms, and Protocols