<?xml version="1.0" encoding="UTF-8"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-10-30T01:52:40Z</responseDate><request verb="GetRecord" identifier="oai:bayburt-rdlopen.rawdatalibrary.net:bayburt/11786" metadataPrefix="oai_dc">https://bayburt-rdlopen.rawdatalibrary.net/oai/request</request><GetRecord><record><header><identifier>oai:bayburt-rdlopen.rawdatalibrary.net:bayburt/11786</identifier><datestamp>2026-10-29T19:41:54Z</datestamp><setSpec>openaire</setSpec><setSpec>com_bayburt_10000</setSpec><setSpec>col_bayburt_10001</setSpec><setSpec>com_bayburt_10010</setSpec><setSpec>col_bayburt_10224</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:title>Genetic algorithm enabled virtual multicast tree embedding in Software-Defined Networks</dc:title><dc:creator>Guler, Evrim</dc:creator><dc:creator>Karakus, Murat</dc:creator><dc:creator>Ayaz, Furkan</dc:creator><dc:subject>Embedding</dc:subject><dc:subject>Genetic</dc:subject><dc:subject>Multicast</dc:subject><dc:subject>SDN</dc:subject><dc:subject>Virtualization</dc:subject><dc:description>The recent network virtualization technology enables the multi-tenancy, where various virtual network requests can share the same physical network by decoupling network services from the underlying hardware architecture. The process of virtual node and link mapping onto a shared Substrate Network (SN) by satisfying the requested network resources (i.e., bandwidth, computing capacity, etc.) is referred to as Virtual Network Embedding (VNE), which is known as an NP-Hard problem. The problem of VNE aims to exhibit one-to-one (unicast) communication. However, the motivation of this research is to explore how to efficiently map virtual networks with one-to-many (multicast) communications, which are in the form of Virtual Multicast Trees (VMTs), onto an SN. This problem differs from the traditional VNE problem and has not been well-studied by the research community. To this end, we propose a novel algorithm, Modified Genetic Algorithm for Virtual Multicast Tree Embedding (MGA-VMTE), to embed VMTs onto a shared SN in this research. The proposed MGA-VMTE algorithm focuses on minimizing the network resource consumption (i.e., bandwidth) under end-to-end delay constraint in the SN while satisfying the computing request of virtual nodes. Our extensive simulations demonstrate that the MGA-VMTE algorithm outperforms the dynamic impact factor and traditional greedy-based virtual multicast tree embedding approaches regarding bandwidth consumption, acceptance ratio, and resource depletion ratio metrics on NSFNET, USNET, Random-60 node, and Random-120 node network topologies.</dc:description><dc:publisher>Academic Press</dc:publisher><dc:date>2023</dc:date><dc:type>Article</dc:type><dc:identifier>https://rdlopen.rawdatalibrary.net/r/bayburt/11786</dc:identifier><dc:identifier>https://doi.org/10.1016/j.jnca.2022.103538</dc:identifier><dc:identifier>1084-8045</dc:identifier><dc:language>en</dc:language><dc:relation>Journal of Network and Computer Applications</dc:relation><dc:rights>info:eu-repo/semantics/closedAccess</dc:rights><dc:type>info:eu-repo/semantics/article</dc:type><dc:identifier>https://bayburt-rdlopen.rawdatalibrary.net/tr/items/bayburt/11786</dc:identifier></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>