![](bg7.png)
performance measures. In Computational Intelli-
gence, Communication Systems and Networks (CIC-
SyN), 2013 Fifth International Conference on, pages
131–136.
Banerjee, S., Misra, A., Yeo, J., and Agrawala, A. (2003).
Energy-Efficient Broadcast and Multicast Trees for
Reliable Wireless Communication.
Doar, M. and Leslie, I. M. (1993). How bad is naive mul-
ticast routing. In IEEE INFOCOM., volume 1, pages
82–89.
Galiasso, P. and Wainwright, R. L. (2001). A hybrid genetic
algorithm for the point to multipoint routing problem
with single split paths. In Proceedings of the 2001
ACM Symposium on Applied Computing, SAC ’01,
pages 327–332. ACM.
Gupta, M. and Singh, S. (2003). Greening of the internet.
In Proceedings of the 2003 Conference on Applica-
tions, Technologies, Architectures, and Protocols for
Computer Communications, SIGCOMM ’03, pages
19–26. ACM.
Karp, R. M. (1972). Reducibility among combinatorial
problems. In Miller, R. E., Thatcher, J. W., and
Bohlinger, J. D., editors, Complexity of Computer
Computations, The IBM Research Symposia Series,
pages 85–103. Springer US.
Koch, T. and Martin, A. (1998). Solving steiner tree prob-
lems in graphs to optimality. Networks, 32:207–232.
Kou, L., Markowsky, G., and Berman, L. (1981). A fast
algorithm for steiner trees. Acta Informatica, 15:141–
145.
Kuphaldt, T. R. (2000-2013). Lessons In Electric Circuits –
Volume 3.
Lun, D. S., Ratnakar, N., Mdard, M., Koetter, R., Karger,
D. R., Ho, T., Ahmed, E., and Zhao, F. (2006).
Minimum-cost multicast over coded packet networks.
IEEE TRANS. INF. ON THE, pages 2608–2623.
Olagbegi, B. S. and Meghanathan, N. (2010). A review
of the energy efficient and secure multicast routing
protocols for mobile ad hoc networks. International
Journal on Applications of Graph Theory In wire-
less Ad Hoc Networks And sensor Networks, 2:1–15.
arXiv:1006.3366 [cs].
Pinto, D. and Barn, B. (2006). Multiobjective multicast
routing with ant colony optimization. In Network
Control and Engineering for Qos, Security and Mo-
bility, V, pages 101–115.
Rajagopal, K. (2007). Engineering Physics. PHI Learning
Pvt. Ltd.
Ramamurthy, B., Datta, D., Feng, H., Heritage, J. P., and
Mukherjee, B. (1999). Impact of transmission impair-
ments on the teletraffic performance of wavelength-
routed optical networks. Journal of Lightwave Tech-
nology, 17:1713–1723.
Wang, X., Cao, J., Cheng, H., and Huang, M. (2006). QoS
multicast routing for multimedia group communica-
tions using intelligent computational methods. Com-
put. Commun., 29:2217–2229.
Wang, X., Cheng, H., Cao, J., Zheng, L., and Huang,
M. (2003). A simulated-annealing-based QoS mul-
ticasting algorithm. In International Conference on
Communication Technology Proceedings, 2003. ICCT
2003, volume 1, pages 469–473 vol.1.
Xi, Y. and Yeh, E. (2010). Distributed algorithms for mini-
mum cost multicast with network coding. IEEE/ACM
Transactions on Networking, 18:379–392.
Xu, Y. (2011). Metaheuristic Approaches for QoS Multicast
Routing Problems. PhD thesis.
Xu, Y. and Qu, R. (2009). A grasp approach for the delay-
constrained multicast routing problem. In Proceed-
ings of the 4th Multidisciplinary International Confer-
ence on Scheduling: Theory and Applications, pages
99–104.
Xu, Y., Qu, R., and Li, R. (2013). A simulated anneal-
ing based genetic local search algorithm for multi-
objective multicast routing problems. Annals of Oper-
ations Research, 206:527–555.
Zahrani, M. S., Loomes, M. J., Malcolm, J. A., Ullah, A.
Z. M. D., Steinhoefel, K., and Albrecht, A. A. (2008).
Genetic local search for multicast routing with pre-
processing by logarithmic simulated annealing. Com-
puters & Operations Research, 35:2049–2070.
Zhang, Q. and Leung, Y.-W. (1999). An orthogonal genetic
algorithm for multimedia multicast routing. Transac-
tions on Evolutionary Computation, 3:53–62.
ICAART2014-InternationalConferenceonAgentsandArtificialIntelligence
746