Khosravian Pouya, Emadi Sima, Mirjalily Ghasem, Zamani Behzad
Department of Computer Engineering, Yazd Branch, Islamic Azad University, Yazd, Iran.
Department of Electrical Engineering, Yazd University, Yazd, Iran.
PeerJ Comput Sci. 2021 Jul 26;7:e603. doi: 10.7717/peerj-cs.603. eCollection 2021.
Service function chaining (SFC) is a mechanism that allows service providers to combine various service functions and exploit the available virtual infrastructure. The best selection of virtual services in the network is essential for meeting user requirements and constraints. This paper proposes a novel approach to generate the optimal composition of the service functions. To this end, a genetic algorithm based on context-free grammar (CFG) that adheres to the Internet Engineering Task Force (IETF) standard and Skyline was developed to use in SFC. The IETF uses cases of the data center, security, and mobile network filtered out the invalid service chains, which resulted in reduced search space. The proposed genetic algorithm found the Skyline service chain instance with the highest quality. The genetic operations were defined to ensure that the service function chains generated in the algorithm process were standard. The experimental results showed that the proposed service composition method outperformed the other methods regarding the quality of service (QoS), running time, and time complexity metrics. Ultimately, the proposed CFG could be generalized to other SFC use cases.
服务功能链(SFC)是一种允许服务提供商组合各种服务功能并利用可用虚拟基础设施的机制。在网络中最佳地选择虚拟服务对于满足用户需求和限制至关重要。本文提出了一种生成服务功能最优组合的新方法。为此,开发了一种基于上下文无关文法(CFG)并符合互联网工程任务组(IETF)标准以及天际线(Skyline)的遗传算法,用于服务功能链。IETF的数据中心、安全和移动网络用例过滤掉了无效的服务链,从而减少了搜索空间。所提出的遗传算法找到了质量最高的天际线服务链实例。定义了遗传操作以确保算法过程中生成的服务功能链是标准的。实验结果表明,所提出的服务组合方法在服务质量(QoS)、运行时间和时间复杂度指标方面优于其他方法。最终,所提出的上下文无关文法可以推广到其他服务功能链用例。