Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks

Sasabe, Masahiro; Hara, Takanori

doi:10.1109/tnsm.2020.3044329

Cited by 26 publications

(31 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NFV chains are embedded using the FIPAM algorithm in MATLAB. The results are compared with stochastic hill climbing (SHC) based placement/chaining strategy and capacitated shortest path tour problem (CSPTP) [30]. The CSPTP scheme solves the placement problem as a shortest path tour problem, by applying greedy-based heuristic on sub-paths between source and destination.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Extensive simulation and experimental results show the superiority of the SIVA algorithm over existing stateof-the-art. In [30], the problem of SFC placement and chaining in NFV-enabled networks is modeled as capacitated shortest path tour problem (CSPTP) based on integer linear programming. The efficiency of the proposed scheme is analyzed in terms of the standard deviation in latency and link utilization.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

FIPAM: Fuzzy Inference Based Placement and Migration Approach for NFV-Based IoTs

Tariq

Farooq

Zeeshan

et al. 2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

FIPAM: Fuzzy Inference Based Placement and Migration Approach for NFV-Based IoTs

Tariq

Farooq

Zeeshan

et al. 2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…Considering the transmission delay between data centers and minimizing the total delay of SFC, a mixed-integer linear programming (MILP) model is established, and it is transformed into a linear programming model by the restriction of decision variables. In [8], aiming at minimizing the total delay of SFC, the similarity between SFC and the shortest path tour problem is studied, and two novel ILP models are established for the service path and function placement based on the proposed augmented network. The author of [9] studied the SFC deployment problem in the environment of time-varying workloads and basic resource consumption of VNF instantiation, and established the ILP model to minimize the number of physical machines used.…”

Section: Sfc Deployment Mathematical Modelmentioning

confidence: 99%

“…To optimize the above SFC deployment problem and find a near-optimal solution in a reasonable time, many scholars have established the mathematical model of SFC deployment [4][5][6][7][8][9][10][11][12][13], and designed heuristic solutions (individual-based [14][15][16][17][18][19], populationbased [20][21][22][23], and others [24][25][26][27][28][29][30][31][32][33]). However, most of these models ignore the constraints of computer architecture on hardware resource allocation; that is, VNF cannot be instantiated with resources of any size, but need to meet certain specification constraints.…”

Section: Introductionmentioning

confidence: 99%

Heuristic Strategy of Service Function Chain Deployment Based on N-Base Continuous Digital Coding in Network Function Virtualization Environment

Liu

2022

Electronics

View full text Add to dashboard Cite

As a novel network architecture, network function virtualization (NFV) greatly improves the flexibility and scalability of service provision. Deploying the service function chain (SFC) in an NFV environment needs to coordinate the instantiation of the virtual network function descriptor, network function embedding, and traffic steering, which also improves the complexity of the problem. Although heuristic algorithms are widely used to optimize this problem, due to the lack of complete SFC deployment solution space and digital coding scheme, the time complexity of the algorithm is difficult to meet the requirements. Therefore, this paper studies the digital coding scheme of the heuristic SFC deployment to improve time efficiency without reducing performance. Firstly, we model the SFC deployment as a 0–1 integer linear programming, considering the above factors, and then design a continuous digital solution space construction scheme based on N-Base coding (NBACO-SS) to optimize the above problems. NBACO-SS uses integer size and carry to map the complex SFC deployment to simple digital coding, evaluates the continuity of solution space through the Manhattan distance, and optimizes the continuity through the ant colony algorithm. Based on NBACO-SS, we reconstruct two heuristic algorithms to solve the SFC deployment problem. Experimental results demonstrate that NBACO-SS can improve the time efficiency by 20% without reducing the total network service traffic.

show abstract

“…This algorithm allocates the shortest and the least costly underlying path to map each of the links of the the service function chain. Masahiro and Takanori [36] formulate the shortest path tour problem as an ILP to solve the service chaining and function placement and to ind the service path that would minimize the delay. Wang et al [37] focused on determining paths for the lows that should cross the service function chain while respecting the right order of the network functions.…”

Section: Related Workmentioning

confidence: 99%

SFCaaS: Service function chains as a service in NFV environments

Moufakir¹,

Zhani²,

Gherbi³

et al. 2022

ITU J-FET

View full text Add to dashboard Cite

With the growing deployment of emergent technologies like software-defined networking, network services are expected to be revolutionized. In this paper, we investigate offering Service Function Chains as a Service (SFCaaS) in NFV environments. We describe the potential business model to offer such a service and then we address the service function chain provisioning and resource allocation problem. As the chain is deployed thanks to virtual machines (i.e., instances) and links, we conduct first a detailed study of the costs of Amazon EC2 instances with respect to their location, size, type and performance. Afterwards, we address the resource allocation problem for service function chains from the SFC provider's perspective. We formulate the problem as an integer linear program aiming at reducing operational costs of the service function chains (i.e., costs of virtual machine instances and links, and synchronization among the instances). To address large-scale instances of the problem, we also propose a new heuristic algorithm to reduce operational costs taking into account the conducted study of the costs of Amazon EC2 instances. We show through extensive simulations that the proposed heuristic significantly reduces operational costs compared to a baseline algorithm inspired by the existing literature.

show abstract

Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks

Cited by 26 publications

References 33 publications

FIPAM: Fuzzy Inference Based Placement and Migration Approach for NFV-Based IoTs

FIPAM: Fuzzy Inference Based Placement and Migration Approach for NFV-Based IoTs

Heuristic Strategy of Service Function Chain Deployment Based on N-Base Continuous Digital Coding in Network Function Virtualization Environment

SFCaaS: Service function chains as a service in NFV environments

Contact Info

Product

Resources

About