Cost-aware service function chain orchestration across multiple data centers

Zhong, Xuxia; Wang, Ying; Qiu, Xuesong; Guo, Shaoyng

doi:10.1109/noms.2018.8406174

Cited by 8 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If so, delete the empire. (8) Determine if there is only one empire; if so, update BATNA according to formulas (17) and (18); otherwise, loop through steps 5-7. (9) Determine whether the number of iterations has reached T. If conditions are met, then the loop is closed, and the optimal imperial position is output.…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…Zhang et al [17] jointly minimized the total number of SDN domains occupied by SFC and the corresponding cost of network resource consumption and proposed a deployment algorithm to solve the optimization problem. Zhong et al [18] formalized the costaware SFC choreography problem across multiple data centers as an ILP optimization problem to coordinate SFC deployment across multiple distributed control centers while considering a distributed control system load. Liu et al [19] proposed a distributed cross-domain mapping method for multidomain collaboration, dividing the mapping into domain-level partitioning, intradomain mapping, and interdomain load balancing.…”

Section: Related Workmentioning

confidence: 99%

“…(3) H-algorithm: a centralized cross-domain SFC deployment method [18] minimizes the total number of SDN domains occupied by SFC and the cost of network resource consumption, transforms the SFC cross-domain problem to an optimization problem, and proposes a heuristic algorithm to solve it.…”

Section: Simulation Experimentsmentioning

confidence: 99%

“…Solutions to the problem of cross-domain SFC deployment are either centralized [15][16][17] or distributed [18,19]. e centralized method has shortcomings in terms of privacy, robustness, and performance optimization of the autonomous domain.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Ren

Liu

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Software-defined networking (SDN) and network function virtualization (NFV) technologies provide support for service function chain (SFC) deployment. As the scale of a network expands, SDN domains are maintained and managed by their respective network operators. When deploying an SFC in multiple domains, to protect the privacy of each domain is challenging. We propose a cross-domain SFC deployment scheme based on a bargaining game. We establish an effective cross-domain service chain system model and combine resource consumption cost and load balance to translate SFC deployment to an optimization problem. A bargaining game model is established so as to reasonably optimize these contradictory parameters. We solve the model by an improved imperialist competition algorithm and obtain the optimal node mapping relationship. Experimental results show that our method performs better than the current one in terms of network load balancing and mapping overhead and has better scalability.

show abstract

Section: Experimental Results and Analysismentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Simulation Experimentsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Ren

Liu

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Sun et al [34] propose and investigate an NFV scalable orchestration solution with the objective of minimizing the energy consumption. Wang et al [35] study cloud and bandwidth resource allocation problems in geographically-distributed data centers interconnected by elastic optical networks; such a problem is also investigated in [36], [37] where the advantages of a provider cost aware resource allocation strategy are investigated. The scenario considered in [35], [36] suits very well to the business model of the NFV ecosystem but the authors consider a static traffic scenario only.…”

Section: Related Workmentioning

confidence: 99%

Optimizing the Cloud Resources, Bandwidth and Deployment Costs in Multi-Providers Network Function Virtualization Environment

Eramo

Lavacca

2019

IEEE Access

View full text Add to dashboard Cite

The introduction of network function virtualization (NFV) leads to a new business model in which the Telecommunication Service Provider needs to rent cloud resources to infrastructure provider (InP) at prices as low as possible. Lowest prices can be achieved if the cloud resources can be rented in advance by allocating long-term virtual machines (VM). This is in contrast with the short-term VMs that are rented on demand and have higher costs. For this reason, we propose a proactive solution in which the cloud resource rent is planned in advance based on peak traffic knowledge. We illustrate the problem of determining the cloud resources in cloud infrastructures managed by different InPs and so as to minimize the sum of cloud resource, bandwidth and deployment costs. We formulate an integer linear problem (ILP) and due to its complexity, we introduce an efficient heuristic approach allowing for a remarkable computational complexity reduction. We compare our solution to a reactive solution in which the cloud resources are rented on demand and dimensioned according to the current traffic. Though the proposed proactive solution needs more cloud and bandwidth resources due to its peak allocation, its total resources cost may be lower than the one achieved when a reactive solution is applied. That is a consequence of the higher cost of short-term VMs. For instance, when a reactive solution is applied with traffic variation times of ten minutes, our proactive solution allows for lower total costs when the long-term VM rent is lower than the short-term VM one by 33%.INDEX TERMS Network function virtualization, cloud infrastructure, short-term virtual machine, Viterbi algorithm.

show abstract

A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing

Kibalya

Serrat

Gorricho

et al. 2021

Computer Communications

View full text Add to dashboard Cite

Cost-aware service function chain orchestration across multiple data centers

Cited by 8 publications

References 15 publications

A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Optimizing the Cloud Resources, Bandwidth and Deployment Costs in Multi-Providers Network Function Virtualization Environment

A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing

Contact Info

Product

Resources

About