{"id":"https://openalex.org/W4415933946","doi":"https://doi.org/10.1109/nof66640.2025.11223301","title":"Multicast Routing Optimization using a Novel Discrete Flower Pollination-based Approach","display_name":"Multicast Routing Optimization using a Novel Discrete Flower Pollination-based Approach","publication_year":2025,"publication_date":"2025-09-30","ids":{"openalex":"https://openalex.org/W4415933946","doi":"https://doi.org/10.1109/nof66640.2025.11223301"},"language":null,"primary_location":{"id":"doi:10.1109/nof66640.2025.11223301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nof66640.2025.11223301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Network of the Future (NoF)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069822459","display_name":"Amina Boudjelida","orcid":"https://orcid.org/0000-0001-6330-7083"},"institutions":[{"id":"https://openalex.org/I116970179","display_name":"University of Jijel","ror":"https://ror.org/03kkfk814","country_code":"DZ","type":"education","lineage":["https://openalex.org/I116970179"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Amina Boudjelida","raw_affiliation_strings":["University of Jijel,LaRIA Laboratory, Faculty of Exact Sciences and Computer Science,Algeria"],"affiliations":[{"raw_affiliation_string":"University of Jijel,LaRIA Laboratory, Faculty of Exact Sciences and Computer Science,Algeria","institution_ids":["https://openalex.org/I116970179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005580212","display_name":"Ali Lemouari","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096460","display_name":"Centre Universitaire de Tamanrasset","ror":"https://ror.org/00r0rx657","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210096460"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Ali Lemouari","raw_affiliation_strings":["University of Tamanrasset,Department of Mathematics and Computer Science,Algeria"],"affiliations":[{"raw_affiliation_string":"University of Tamanrasset,Department of Mathematics and Computer Science,Algeria","institution_ids":["https://openalex.org/I4210096460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070352139","display_name":"Wael Jaafar","orcid":"https://orcid.org/0000-0003-4378-9999"},"institutions":[{"id":"https://openalex.org/I9736820","display_name":"\u00c9cole de Technologie Sup\u00e9rieure","ror":"https://ror.org/0020snb74","country_code":"CA","type":"education","lineage":["https://openalex.org/I49663120","https://openalex.org/I9736820"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wael Jaafar","raw_affiliation_strings":["&#x00C9;cole de Technologie Sup&#x00E9;rieure (&#x00C9;TS),Department of Software and IT Engineering,Montreal,Canada"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole de Technologie Sup&#x00E9;rieure (&#x00C9;TS),Department of Software and IT Engineering,Montreal,Canada","institution_ids":["https://openalex.org/I9736820"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014570675","display_name":"Rami Langar","orcid":"https://orcid.org/0000-0002-4674-6700"},"institutions":[{"id":"https://openalex.org/I9736820","display_name":"\u00c9cole de Technologie Sup\u00e9rieure","ror":"https://ror.org/0020snb74","country_code":"CA","type":"education","lineage":["https://openalex.org/I49663120","https://openalex.org/I9736820"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Rami Langar","raw_affiliation_strings":["&#x00C9;cole de Technologie Sup&#x00E9;rieure (&#x00C9;TS),Department of Software and IT Engineering,Montreal,Canada"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole de Technologie Sup&#x00E9;rieure (&#x00C9;TS),Department of Software and IT Engineering,Montreal,Canada","institution_ids":["https://openalex.org/I9736820"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069822459"],"corresponding_institution_ids":["https://openalex.org/I116970179"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40321818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"10","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.4153999984264374,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.4153999984264374,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.396699994802475,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.0820000022649765,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.887499988079071},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6299999952316284},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.5620999932289124},{"id":"https://openalex.org/keywords/xcast","display_name":"Xcast","score":0.5558000206947327},{"id":"https://openalex.org/keywords/distance-vector-multicast-routing-protocol","display_name":"Distance Vector Multicast Routing Protocol","score":0.5185999870300293},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5058000087738037},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.49320000410079956},{"id":"https://openalex.org/keywords/source-specific-multicast","display_name":"Source-specific multicast","score":0.4772999882698059}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.887499988079071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7361999750137329},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6299999952316284},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.592199981212616},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.5620999932289124},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.5558000206947327},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5478000044822693},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.5185999870300293},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.49320000410079956},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.421099990606308},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4027000069618225},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.376800000667572},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C192240487","wikidata":"https://www.wikidata.org/wiki/Q17156927","display_name":"Multicast address","level":4,"score":0.29490000009536743},{"id":"https://openalex.org/C5111613","wikidata":"https://www.wikidata.org/wiki/Q3799443","display_name":"Inter-domain","level":4,"score":0.27379998564720154},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2694999873638153}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/nof66640.2025.11223301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nof66640.2025.11223301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Network of the Future (NoF)","raw_type":"proceedings-article"},{"id":"pmh:oai:espace2.etsmtl.ca:33168","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402392","display_name":"Espace \u00c9TS (ETS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1341030882","host_organization_name":"Educational Testing Service","host_organization_lineage":["https://openalex.org/I1341030882"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Non \u00e9valu\u00e9 par les pairs"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W124060458","https://openalex.org/W1606402766","https://openalex.org/W1973020130","https://openalex.org/W1975290397","https://openalex.org/W1976085508","https://openalex.org/W2015126294","https://openalex.org/W2015139100","https://openalex.org/W2015841735","https://openalex.org/W2017927472","https://openalex.org/W2020643293","https://openalex.org/W2049236369","https://openalex.org/W2086709935","https://openalex.org/W2096774592","https://openalex.org/W2105808107","https://openalex.org/W2109988251","https://openalex.org/W2150064396","https://openalex.org/W2169528473","https://openalex.org/W2171846149","https://openalex.org/W2491967821","https://openalex.org/W2556795721","https://openalex.org/W2752590451","https://openalex.org/W2793758168","https://openalex.org/W2909666304","https://openalex.org/W2969490844","https://openalex.org/W2993532104","https://openalex.org/W3003745675","https://openalex.org/W3007352112","https://openalex.org/W3023869946","https://openalex.org/W3121235765","https://openalex.org/W3134009661","https://openalex.org/W3135934252","https://openalex.org/W4240158848","https://openalex.org/W4391114523","https://openalex.org/W4391128859"],"related_works":[],"abstract_inverted_index":{"Multicast":[0],"routing":[1,66],"with":[2],"Quality":[3],"of":[4,93,117,128,135],"Service":[5],"(QoS)":[6],"requirements":[7,114],"is":[8,60,100],"considered":[9],"a":[10,34,73],"non-linear":[11],"combinatorial":[12],"optimization":[13,76],"problem":[14,38,92],"in":[15,40,115,133],"network":[16,123],"communication.":[17],"Existing":[18],"approaches":[19,48],"rely":[20],"on":[21,79,121],"constructing":[22],"multicast":[23,65,94,103],"trees":[24,104],"to":[25,33,43,62,87,101],"address":[26],"this":[27,69],"issue,":[28],"which":[29],"can":[30],"be":[31,44],"reduced":[32],"minimal":[35],"Steiner":[36],"tree":[37],"(MStTG)":[39],"graphs,":[41],"proven":[42],"NP-complete.":[45],"However,":[46],"these":[47],"do":[49],"not":[50],"ensure":[51],"stringent":[52,112],"QoS,":[53],"such":[54],"as":[55],"end-to-end":[56],"delay.":[57,118],"Consequently,":[58],"it":[59],"crucial":[61],"adopt":[63],"advanced":[64],"strategies.":[67],"In":[68],"paper,":[70],"we":[71],"propose":[72],"novel":[74],"bio-inspired":[75],"method":[77],"based":[78],"the":[80,89,107,126,129],"discrete":[81],"greedy":[82],"flower":[83],"pollination":[84],"algorithm":[85],"(DGFPA)":[86],"solve":[88],"delay-constrained":[90],"least-cost":[91],"routing.":[95],"Indeed,":[96],"our":[97],"main":[98],"focus":[99],"determine":[102],"that":[105],"optimize":[106],"cost":[108,136],"function":[109],"while":[110],"satisfying":[111],"QoS":[113],"terms":[116,134],"Computational":[119],"experiments":[120],"different":[122],"settings":[124],"demonstrate":[125],"effectiveness":[127],"proposed":[130],"DGFPA-based":[131],"solution":[132],"and":[137,140],"delay":[138],"performances":[139],"its":[141],"superiority":[142],"over":[143],"benchmark":[144],"methods.":[145]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-05T00:00:00"}
