A genetic algorithm for the degree-constrained multicasting problem
5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612) - Trang 315-319
Tóm tắt
In communication networks, the degree-constrained multicasting problem is of great importance, which can be formulated as finding a minimal cost tree in the presence of constraints on the copying ability of the individual switch nodes in the networks. Up to now, there are few efficient algorithms for solving this problem because of its NP-hard complexity. A new approach for solving this degree-constrained problem by using a genetic algorithm is presented, and our experimental results show that this genetic algorithm provides fast and good quality of solutions.
Từ khóa
#Genetic algorithms #Switches #Communication networks #Costs #Multicast algorithms #Computer science #Electronic mail #Communication switching #Multimedia communication #TeleconferencingTài liệu tham khảo
10.1109/INFCOM.1992.263481
10.1109/INFCOM.1995.515897
10.1109/ICSMC.1996.561363
10.1109/72.265964
10.1109/49.12889
10.1002/net.3230220105
10.1109/TCOM.1983.1095818
10.1016/S0140-3664(97)00124-2
10.1002/net.3230170203
10.1109/90.222923
10.1109/4235.738982
10.1002/net.3230190102
vob, 1992, Steiner's problem in graphs: heuristic methods, Discrete Applied Mathematics, 40, 45, 10.1016/0166-218X(92)90021-2
woss, 1992, Problems with generalized steiner problems, Algorithmica, 17, 333