{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T17:27:17Z","timestamp":1764955637319,"version":"3.46.0"},"reference-count":26,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T00:00:00Z","timestamp":1421020800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.<\/jats:p>","DOI":"10.1515\/jisys-2014-0043","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T03:21:48Z","timestamp":1421032908000},"page":"479-489","source":"Crossref","is-referenced-by-count":0,"title":["Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees"],"prefix":"10.1515","volume":"24","author":[{"given":"Muhammad Atif","family":"Tahir","sequence":"first","affiliation":[{"name":"School of Computer Science and Digital Technologies, Northumbria University, Newcastle upon Tyne, NE1 8ST , UK"}]},{"given":"Asif","family":"Jamshed","sequence":"additional","affiliation":[]},{"given":"Habib-ur","family":"Rehman","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, KSA"}]},{"given":"Yassine","family":"Daadaa","sequence":"additional","affiliation":[{"name":"College of Computer and Information Sciences, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, KSA"}]}],"member":"374","published-online":{"date-parts":[[2015,1,12]]},"reference":[{"key":"2025120517222278730_j_jisys-2014-0043_ref_001_w2aab3b7c37b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"M. Armaghan and A. T. Haghighat, QoS multicast routing algorithms based on tabu search with elite candidate list, in: International Conference on Application of Information and Communication Technologies, 2009, AICT 2009, pp. 1\u20135, IEEE, 2009.10.1109\/ICAICT.2009.5372563","DOI":"10.1109\/ICAICT.2009.5372563"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_002_w2aab3b7c37b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"M. L. P. Bueno and G. Oliveira, A dynamic multiobjective evolutionary algorithm for multicast routing problem, in: IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI), 2013, pp. 344\u2013350, IEEE, 2013.10.1109\/ICTAI.2013.59","DOI":"10.1109\/ICTAI.2013.59"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_003_w2aab3b7c37b1b6b1ab2ab3Aa","doi-asserted-by":"crossref","unstructured":"H. Cheng and S. Yang, Hyper-mutation based genetic algorithms for dynamic multicast routing problem in mobile ad hoc networks, in: 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 1586\u20131592, IEEE, 2012.10.1109\/TrustCom.2012.179","DOI":"10.1109\/TrustCom.2012.179"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_004_w2aab3b7c37b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"Y.-f. Dai and N.-f. Li, Comparison and analysis of several non-rearranged dynamic multicast routing algorithms, in: Third International Conference on Photonics and Image in Agriculture Engineering, 2013.10.1117\/12.2019687","DOI":"10.1117\/12.2019687"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_005_w2aab3b7c37b1b6b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"H. Fujinokia and K. J. Christensen, A routing algorithm for dynamic multicast trees with end-to-end path length control, Comput. Commun.23 (2000), 101\u2013114.10.1016\/S0140-3664(99)00167-X","DOI":"10.1016\/S0140-3664(99)00167-X"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_006_w2aab3b7c37b1b6b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"F. Glover, Tabu search I, ORSA J. Comput.1 (1989), 190\u2013206.10.1287\/ijoc.1.3.190","DOI":"10.1287\/ijoc.1.3.190"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_007_w2aab3b7c37b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"F. Glover, Tabu search II, ORSA J. Comput.2 (1990), 4\u201332.10.1287\/ijoc.2.1.4","DOI":"10.1287\/ijoc.2.1.4"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_008_w2aab3b7c37b1b6b1ab2ab8Aa","unstructured":"S. Hong, H. Lee and B. H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership, in: IEEE INFOCOM, pp. 1433\u20131440, 1998."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_009_w2aab3b7c37b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"M. Kim, H. Choo, M. W. Mutka, H.-J. Lim and K. Park, On QoS multicast routing algorithms using k-minimum Steiner trees, Inform. Sci.238 (2013), 190\u2013204.10.1016\/j.ins.2013.03.006","DOI":"10.1016\/j.ins.2013.03.006"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_010_w2aab3b7c37b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"V. P. Kompella, J. C. Pasquale and G. C. Polyzos, Multicast routing for multimedia communication, IEEE\/ACM Trans. Network.1 (1993), 286\u2013292.10.1109\/90.234851","DOI":"10.1109\/90.234851"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_011_w2aab3b7c37b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"H.-Y. Lin and T.-C. Chiang, Efficient key agreements in dynamic multicast height balanced tree for secure multicast communications in ad hoc networks, EURASIP J. Wireless Commun. Network.2011 (2011), 382701.10.1155\/2011\/382701","DOI":"10.1155\/2011\/382701"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_012_w2aab3b7c37b1b6b1ab2ac12Aa","unstructured":"H. Lin and S. Lai, VTDM \u2013 a dynamic multicast routing problem, in: IEEE INFOCOM, pp. 1426\u20131432, 1998."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_013_w2aab3b7c37b1b6b1ab2ac13Aa","unstructured":"T. M. Mahmoud, A. I. El Nashar and M. Eman, An efficient genetic algorithm based clonal selection and hill climbing for solving QoS multicast routing problem, Int. J. Comput. Sci. Issues (IJCSI)11 (2014)."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_014_w2aab3b7c37b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"G. Manimaran and S. Raghavan, A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees, IEEE\/ACM Transact. Network.7 (1999), 514\u2013529.10.1109\/90.793020","DOI":"10.1109\/90.793020"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_015_w2aab3b7c37b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"L. Qingmei and H. Lilin, Research on the routing algorithm based greedy multicast algorithm, in: International Conference on Computer Applications and System Modeling, 2010.10.1109\/ICCASM.2010.5622345","DOI":"10.1109\/ICCASM.2010.5622345"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_016_w2aab3b7c37b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"R. Qu, Y. Xu, J. P. Castro and D. Landa-Silva, Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems, J. Heuristics19 (2013), 317\u2013342.10.1007\/s10732-012-9198-2","DOI":"10.1007\/s10732-012-9198-2"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_017_w2aab3b7c37b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"H. F. Salama, D. S. Reeves and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high speed networks, IEEE J. Sel. Area. Commun.15 (1997), 332\u2013346.10.1109\/49.564132","DOI":"10.1109\/49.564132"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_018_w2aab3b7c37b1b6b1ab2ac18Aa","unstructured":"M. A. Tahir, H. Youssef, A. Almulhem and S. M. Sait, Fuzzy based multiobjective multicast routing using tabu search, in: International Conference on Internet Computing, 2002."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_019_w2aab3b7c37b1b6b1ab2ac19Aa","unstructured":"H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Mathematica Japonica24 (1980), 573\u2013577."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_020_w2aab3b7c37b1b6b1ab2ac20Aa","doi-asserted-by":"crossref","unstructured":"X. Wang, J. Cao, H. Cheng and M. Huang, QoS multicast routing for multimedia group communications using intelligent computational methods, Comput. Commun.29 (2006), 2217\u20132229.10.1016\/j.comcom.2006.02.015","DOI":"10.1016\/j.comcom.2006.02.015"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_021_w2aab3b7c37b1b6b1ab2ac21Aa","doi-asserted-by":"crossref","unstructured":"B. M. Waxman, Routing of multipoint connections, IEEE J. Sel. Area. Commun.6 (1988), 1617\u20131622.10.1109\/49.12889","DOI":"10.1109\/49.12889"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_022_w2aab3b7c37b1b6b1ab2ac22Aa","unstructured":"R. Widyono, The design and evaluation of routing algorithms for real-time channels, Tech Report ICSI TR-94-024, University of California at Berkeley, International Computer Science Institute, June 1994."},{"key":"2025120517222278730_j_jisys-2014-0043_ref_023_w2aab3b7c37b1b6b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"Y. Xu and R. Qu, A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems, Appl. Intell.36 (2012), 229\u2013241.10.1007\/s10489-010-0256-x","DOI":"10.1007\/s10489-010-0256-x"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_024_w2aab3b7c37b1b6b1ab2ac24Aa","doi-asserted-by":"crossref","unstructured":"P.-Y. Yin, R.-I. Chang, C.-C. Chao and Y.-T. Chu, Niched ant colony optimization with colony guides for QoS multicast routing, J. Network. Comput. Appl.40 (2014), 61\u201372.10.1016\/j.jnca.2013.08.003","DOI":"10.1016\/j.jnca.2013.08.003"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_025_w2aab3b7c37b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"H. Youssef, A. Almulhem, Sadiq M. Sait and M. A. Tahir, QoS-driven multicast tree generation using tabu search, Comput. Commun.25 (2002), 1140\u20131149.10.1016\/S0140-3664(02)00029-4","DOI":"10.1016\/S0140-3664(02)00029-4"},{"key":"2025120517222278730_j_jisys-2014-0043_ref_026_w2aab3b7c37b1b6b1ab2ac26Aa","unstructured":"Q. Zhu, M. Parsa and J. Garcia, A source-based algorithm for delay-constrained minimum-cost multicasting, in: IEEE INFOCOM 95, pp. 353\u2013360, 1995."}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/24\/4\/article-p479.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2014-0043\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2014-0043\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T17:24:03Z","timestamp":1764955443000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2014-0043\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,12]]},"references-count":26,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,2,14]]},"published-print":{"date-parts":[[2015,12,1]]}},"alternative-id":["10.1515\/jisys-2014-0043"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2014-0043","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2015,1,12]]}}}