Open Access
E3S Web Conf.
Volume 229, 2021
The 3rd International Conference of Computer Science and Renewable Energies (ICCSRE’2020)
Article Number 01009
Number of page(s) 7
Published online 25 January 2021
  1. Christophe Diot, Brian Neil Levine, Bryan Lyles, Hassan Kassem, and Doug Balensiefen. Deployment issues for the ip multicast service and architecture. IEEE network, 14(1):78-88, 2000. [CrossRef] [Google Scholar]
  2. Aaron Striegel and G Manimaran. A survey of qos multicasting issues. IEEE Communications magazine, 40(6):82-87, 2002. [CrossRef] [Google Scholar]
  3. Ying Xu. Metaheuristic approaches for QoS multicast routing problems. PhD thesis, University of Nottingham Nottingham, 2011. [Google Scholar]
  4. Rong Qu, Ying Xu, and Graham Kendall. A variable neighborhood descent search algorithm for delay-constrained least-cost multicast routing. In International Conference on Learning and Intelligent Optimization, pages 15-29. Springer, 2009. [Google Scholar]
  5. Sung-Ju Lee, Mario Gerla, and Ching-Chuan Chiang. On-demand multicast routing protocol. In WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No. 99TH8466), volume 3, pages 1298-1302. IEEE, 1999. [Google Scholar]
  6. Aneesha Boppana et al. A scalable simplified multicast forwarding for mobile ad-hoc networks. 2011. [Google Scholar]
  7. Guillaume Chelius and E´ ric Fleury. Performance evaluation of multicast trees in adhoc networks. 2002. [Google Scholar]
  8. Abolfazl Toroghi Haghighat, Karim Faez, Mehdi Dehghan, Amir Mowlaei, and Y Ghahremani. Gabased heuristic algorithms for qos based multicast routing. Knowledge-Based Systems, 16(5-6):305-312, 2003. [CrossRef] [Google Scholar]
  9. Mehrdad Parsa, Qing Zhu, and JJ Garcia-Luna-Aceves. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM transactions on networking, 6(4):461-474, 1998. [CrossRef] [Google Scholar]
  10. Quan Sun and Horst Langendo¨rfer. An efficient delay-constrained multicast routing algorithm. Journal of High Speed Networks, 7(1):43-55, 1998. [Google Scholar]
  11. Wang Zhengying, Shi Bingxin, and Zhao Erdun. Bandwidth-delayconstrained least-cost multicast routing based on heuristic genetic algorithm. Computer communications, 24(7-8):685-692, 2001. [CrossRef] [Google Scholar]
  12. Nina Skorin-Kapov and Mladen Kos. A grasp heuristic for the delayconstrained multicast routing problem. Telecommunication Systems, 32(1):55-69, 2006. [CrossRef] [Google Scholar]
  13. Sheng-Yuan Tseng, Chang-Chun Lin, and Yueh-Min Huang. Ant colonybased algorithm for constructing broadcasting tree with degree and delay constraints. Expert Systems with Applications, 35(3):1473-1481, 2008. [CrossRef] [Google Scholar]
  14. Li Zhang, Lian-bo Cai, Meng Li, and Fa-hui Wang. A method for least-cost qos multicast routing based on genetic simulated annealing algorithm. Computer Communications, 32(1):105-110, 2009. [CrossRef] [Google Scholar]
  15. Wenhong Wei, Yong Qin, and Zhaoquan Cai. A multi-objective multicast routing optimization based on differential evolution in manet. International Journal of Intelligent Computing and Cybernetics, 2018. [Google Scholar]
  16. Xiaoxia Zhang, Xin Shen, and Ziqiao Yu. A novel hybrid ant colony optimization for a multicast routing problem. Algorithms, 12(1):18, 2019. [CrossRef] [Google Scholar]
  17. Ibrahim Matta and Liang Guo. Qdmr: An efficient qos dependent multicast routing algorithm. Journal of Communications and Networks, 2(2):168-176, 2000. [CrossRef] [Google Scholar]
  18. L Kou, George Markowsky, and Leonard Berman. A fast algorithm for steiner trees. Acta informatica, 15(2):141-145, 1981. [CrossRef] [Google Scholar]
  19. Carlos AS Oliveira and Panos M Pardalos. Mathematical aspects of network routing optimization. Springer, 2011. [CrossRef] [Google Scholar]
  20. Misa Fujita, Takayuki Kimura, and Kenya Jin’no. An effective construction algorithm for the steiner tree problem based on edge betweenness. Journal of Signal Processing, 20(4):145-148, 2016. [CrossRef] [Google Scholar]
  21. Nejla Ghaboosi and Abolfazl T Haghighat. Tabu search based algorithms for bandwidth-delayconstrained least-cost multicast routing. Telecommunication Systems, 34(3-4):147-166, 2007. [CrossRef] [Google Scholar]
  22. Nina Skorin-Kapov and Mladen Kos. The application of steiner trees to delay constrained multicast routing: a tabu search approach. In Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003., volume 2, pages 443-448. IEEE, 2003. [Google Scholar]
  23. Habib Youssef, Abdulaziz Al-Mulhem, Sadiq M Sait, and Muhammad Atif Tahir. Qos-driven multicast tree generation using tabu search. Computer Communications, 25(11-12):1140-1149, 2002. [CrossRef] [Google Scholar]
  24. Moatamad Hassan, Ahmed Hamid, and Monagi Alkinani. Ant colony optimization for multi-objective multicast routing. Computers, Materials & Continua, 63(3):1159-1173, 2020. [CrossRef] [Google Scholar]
  25. Nina Skorin-Kapov and Mladen Kos. A grasp heuristic for the delayconstrained multicast routing problem. Telecommunication Systems, 32(1):55-69, 2006. [CrossRef] [Google Scholar]
  26. Ying Xu and Rong Qu. A hybrid scatter search meta-heuristic for delayconstrained multicast routing problems. Applied Intelligence, 36(1):229-241, 2012. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.