Year: 2026
Type: article
Abstract: In the last decades, there has been a trend to virtualize computing and networking resources over the physical infrastructure. This approach was initially adopted in the core functions of the network, thus creating the network function virtualization paradigm. The process which defines the computational nodes and links to execute a set of virtual network functions (VNFs) is called placement. However, executing only VNFs individually is often not enough to meet users’ requirements. Therefore, the service function chain (SFC) concept was created. With the advancement of the edge-cloud continuum infrastructure, SFCs started to be executed on multiple nodes, sometimes managed by independent service providers. In this multi-domain scenario, a distributed placement mechanism to allocate SFCs without complete knowledge of the infrastructure where the VNF instances will be executed is required. In this paper, we propose a new approach, named SPEED, to solve the SFC placement problem (SFCPP) over a multi-domain environment in a distributed manner. The solution encompasses algorithms and a new mapping model between the SFCPP and the game theory approach. The results of a simulation-based performance evaluation show that SPEED is feasible and, compared to other approaches, has a gain of 30% in the number of SFC requests placed successfully.
Source: Annals of Telecommunications
Institution: Universidade Federal Fluminense
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,890
OpenAlex ID: W7130818485