Cost-aware Placement and Chaining of Service Function Chain with VNF Instance Sharing

Guo, Hantao; Wang, Ying; Li, Zifan; Qiu, Xuesong; An, Hengbin; Yu, Peng; Yuan, Ningcheng

doi:10.1109/noms47738.2020.9110360

Cited by 18 publications

(15 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed ILP model was solved using the Gurobi solver [38]. The main objective of work proposed by Guo et al [34] was to reduce deployment costs by sharing VNFs between different SFCs in order to avoid multiple VNF instantiation across the network. The authors formulated the SFC placement problem as a mixed ILP (MILP) and presented an algorithm for solving it.…”

Section: Operational Costmentioning

confidence: 99%

“…Most of the papers (35 out of 60) considered different network topologies based on the different worldwide ISPs [64,110,88,34,62,53,54,14,13,29,112,58,101,73,15,116,60,109,78,30,116,89,94,17,106,122,115,65,37,20,36,117,10,120,59]. In this context, we can highlight applications considering the network topologies of China's Telecom [14], USNET [94,115,122,29], NSFNET [94,115,122,73,116,54,112,29], The German backbone network [110,…”

Section: Scenariosmentioning

confidence: 99%

“…bandwidth [80], [14], [85], [58], [116], [122], [115] congestion [89] Cost operational cost [76], [107], [34], [62], [53], [54], [65], [35], [50], [29], [123], [20], [36], [21], [44], [8], [120], [117], [60], [47], [109], [89], [94], [49], [27] Costs involving some solutions are also considered. Here, the operating cost considers the cost of infrastructure equipment necessary to meet demand and budget constraints and maximizing expected revenue.…”

Section: Qosmentioning

confidence: 99%

“…Here the use of CPU, memory, and link are observed as restrictions to achieve the defined objectives, in addition to the number of nodes distributed geographically, and the number of VNFs instantiated to meet the demand. number of nodes or VNF instances [58], [116], [122], [115], [34], [50], [112], [78] Load balancing load balancing [13], [112], [120] Load balancing restrictions were also presented as evaluation metrics in articles found in the literature.…”

Section: Qosmentioning

confidence: 99%

See 3 more Smart Citations

Service Function Chain Placement in Distributed Scenarios: A Systematic Review

et al. 2021

View full text Add to dashboard Cite

The network function virtualization (NFV) paradigm is an emerging technology that provides network flexibility by allowing the allocation of network functions over commodity hardware, like legacy servers in an IT infrastructure. In comparison with traditional network functions, implemented by dedicated hardware, the use of NFV reduces the operating and capital expenses and improves service deployment. In some scenarios, a complete network service can be composed of several functions, following a specific order, known as a service function chain (SFC). SFC placement is a complex task, already proved to be NP-hard. Moreover, in highly distributed scenarios, the network performance can also be impacted by other factors, such as traffic oscillations and high delays. Therefore, a given SFC placement strategy must be carefully developed to meet the network operator service constraints. In this paper, we present a systematic review of SFC placement advances in dis-

show abstract

Section: Operational Costmentioning

confidence: 99%

Section: Scenariosmentioning

confidence: 99%

Section: Qosmentioning

confidence: 99%

Section: Qosmentioning

confidence: 99%

See 2 more Smart Citations

Service Function Chain Placement in Distributed Scenarios: A Systematic Review

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Then, they offered a heuristic algorithm based on the Steiner tree problem and the Markov decision process. 17 Khoshkholghi et al formulated a multi-objective optimization model to joint VNF placement and link embedding to reduce deployment cost and service latency concerning various constraints. They then solved the optimization problem using two heuristic-based algorithms that perform close to optimum for large-scale clouds or edge environments.…”

Section: Literature Reviewmentioning

confidence: 99%

Service function chain composition and placement using grammar‐based genetic algorithm

Khosravian

Emadi

Mirjalily

et al. 2021

Concurrency and Computation

View full text Add to dashboard Cite

Service function chaining (SFC) creates a requested orchestration for composition and placement of several service functions. One of the most critical issues for the service function providers is achieving the highest quality of service. We consider the problem of optimal Service Function composition and placement in an SFC-enabled network with the aim of achieving maximum Quality of Service (QoS). To this end, a method of merging the composition, routing, and placement phases is introduced. A genetic algorithm is designed to find the service chain instance with the maximum QoS using grammar-based Genetic Algorithm (GA) operators. This grammar is provided to filter invalid service compositions based on the data center, security, and mobile scenarios defined by Internet engineering task force. A chromosome in the proposed genetic algorithm corresponds to a service chain instance that matches the proposed grammar.For routing, strongly connected components (SCCs) are extracted to reduce search time in the network. Consequently, the search space is reduced for requests whose start and end nodes are placed in a SCC. Besides, the Floyd Warshall algorithm is used for routing between consecutive services. According to the results, the proposed method outperformed other methods in terms of the number of responded requests, runtime, and cost.

show abstract

Migration of VNF instances for service continuity

Siasi

2023

Internet Technology Letters

View full text Add to dashboard Cite

Fog computing computes and stores data locally based upon distributed architectures that extend cloud to the edge of the network. This enables fog paradigms to be suitable for delay-sensitive applications that demand various network functions (NFs). These NFs here are provided using network function virtualization (NFV) to allow elastic NF deployment on the fog nodes, that is, virtual network functions (VNFs). Now a major challenge for NFV-based fog architectures is the limited resources, which vulnerate them to premature saturation and load imbalance. Hence resource management schemes are necessary for fog networks, in particular load migration and redistribution. Along this, an efficient migration scheme is proposed here using the coordinated generalized pattern search (CGPS) heuristic method. The scheme migrates excess load from heavily-loaded (HL) nodes to lightly-loaded (LL) nodes in proximity. The scheme adopts two criteria, termed as exclusive and common use of VNF instances. Results show that the proposed scheme achieves high migration success at reduced delays, as well as alleviating resources with low migration frequency.

show abstract

Cost-aware Placement and Chaining of Service Function Chain with VNF Instance Sharing

Cited by 18 publications

References 15 publications

Service Function Chain Placement in Distributed Scenarios: A Systematic Review

Service Function Chain Placement in Distributed Scenarios: A Systematic Review

Service function chain composition and placement using grammar‐based genetic algorithm

Migration of VNF instances for service continuity

Contact Info

Product

Resources

About