{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T06:22:12Z","timestamp":1762410132936,"version":"build-2065373602"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,30]]},"DOI":"10.1109\/nof66640.2025.11223301","type":"proceedings-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T18:37:39Z","timestamp":1762367859000},"page":"10-18","source":"Crossref","is-referenced-by-count":0,"title":["Multicast Routing Optimization using a Novel Discrete Flower Pollination-based Approach"],"prefix":"10.1109","author":[{"given":"Amina","family":"Boudjelida","sequence":"first","affiliation":[{"name":"University of Jijel,LaRIA Laboratory, Faculty of Exact Sciences and Computer Science,Algeria"}]},{"given":"Ali","family":"Lemouari","sequence":"additional","affiliation":[{"name":"University of Tamanrasset,Department of Mathematics and Computer Science,Algeria"}]},{"given":"Wael","family":"Jaafar","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure (ÉTS),Department of Software and IT Engineering,Montreal,Canada"}]},{"given":"Rami","family":"Langar","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure (ÉTS),Department of Software and IT Engineering,Montreal,Canada"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2006.04.012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/65.819174"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1007412"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/24.877336"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09952-0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2299\/jsp.20.145"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1051\/e3sconf\/202122901009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70866-5_23"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00273-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2008.03.019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-006-8202-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/a12010018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1504\/IJCNDS.2019.098873"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2020.09176"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105276"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112889"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/AIKIIE60097.2023.10390117"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2024.3357769"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4236\/jcc.2016.414005"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2000.6596737"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9624-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3176-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00029-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113345"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2005.01.017"},{"volume-title":"New benchmark instances for the Steiner problem in graphs","year":"2004","author":"Resende","key":"ref35"}],"event":{"name":"2025 16th International Conference on Network of the Future (NoF)","start":{"date-parts":[[2025,9,30]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2025,10,3]]}},"container-title":["2025 16th International Conference on Network of the Future (NoF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11223274\/11223287\/11223301.pdf?arnumber=11223301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T06:08:22Z","timestamp":1762409302000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11223301\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,30]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/nof66640.2025.11223301","relation":{},"subject":[],"published":{"date-parts":[[2025,9,30]]}}}