A genetic algorithm for multicasting routing problem

International Conference on Communication Technology Proceedings, ICCT

Volumn 2, Issue , 2000, Pages 1248-1253

  Zhou, Xianwei ^a   Chen, Changjia ^a   Zhu, Gang ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Genetic algorithm; Heuristic; Multicast communication; Multicast routing; Shared tree; Shortest path tree; Steiner tree

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; MULTICASTING; NETWORK ROUTING;

HEURISTIC; MULTICAST COMMUNICATION; MULTICAST ROUTING; SHARED TREE; SHORTEST PATH TREE; STEINER TREES;

TREES (MATHEMATICS);

EID: 84950146179     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCT.2000.890896     Document Type: Conference Paper

References (6)

1. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1992.
2. K. Bharath-Kumar and J. M. Jaffe, Routing to multiple destinations in computer networks. IEEE Trans. Commun, Vol. COMM-31, No. 3., 1983, 343-351.
3. M. R. Garey and D. S. Johnson, Computers and intractability. New York, Freeman, 1979.
4. G. N. Rouskas, Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on selected areas in communications, No. 3., 1997, 346-156.
5. H. Esbensen, Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. Networks, Vol. 26, 1995, 173-185.
6. Xianwei Zhou, Genetic algorithm for stochastic optimal control traffic assignment problem, proceedings of neural networks and brain on international conference in 1998, 305-309