... routing for low-cost multicast. IEEE Journal on Selected Areas in Communications 15, 373–381 (1997) Kou, L ... delay variationbounded Steiner tree using simulated annealing. Computer Communications 28, 1356–1370 (2005) Wang, Z ...
... Delay-Constrained Minimum Span- ning Tree Problem. In: Blum, C., Roli, A., Sampels, M. (eds.) Proceedings of the 2nd IEEE Symposium on Computers and Communications, pp. 699–703 (1997) 6. Ruthmair, M., Raidl, G.R.: A Kruskal-Based ...
... delay- constrained minimum spanning tree problem which produces faster and bet- ter results especially for tight delay - bounds and Euclidian edge - costs compared to the Prim - based approach . The runtime is almost independent of the ...
... Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. In: Proceedings of the 19th IEEE ... Problem. Computers and Operations Research 35(2), 600–613 (2008) 4. Leggieri, V., Haouari, M., Triki, C.: An ...
... path relinking approach for delay - constrained least - cost multicast routing problem . In : 19th IEEE International Conference on Tools with Artificial Intelligence , ICTAI 2007 , vol . 1 ... Multicast Routing Problem 139 References.
This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms.
We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed.
This comprehensive handbook brings together experts who use optimization to solve problems that arise in telecommunications. It is the first book to cover in detail the field of optimization in telecommunications.