Name
Abstract | ||
|---|---|---|
Network Function Virtualization (NFV) is an emerging technology proposed to improve service provisioning in telecommunication industry. The flexibility of NFV enables network operator to dynamically deploy Virtual Network Functions (VNFs) according to real-time requirements. However, a large amount of VNFs with low utilization may be deployed in network due to dynamic arrival and departure of services and excessive deployment of VNFs. In this paper, we analyse this phenomenon and model it as the Network Function Consolidation (NFC) problem, followed by an Integer Linear Programming (ILP) formulation. We also design a greedy based heuristic to solve large scale cases. We conduct simulations on both real-world and random generated network topologies, and the results show that we can reduce 32% number of VNFs in average. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICC.2016.7510679 | 2016 IEEE International Conference on Communications (ICC) |
Keywords | Field | DocType |
Network Function Virtualization,Service Function Chaining,Network Function Consolidation | Virtual network,Virtualization,Heuristic,Chaining,Computer science,Server,Computer network,Real-time computing,Network topology,Integer programming,Orchestration (computing),Distributed computing | Conference |
ISSN | ISBN | Citations |
1550-3607 | 978-1-4799-6665-3 | 6 |
PageRank | References | Authors |
0.46 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Wen | 1 | 50 | 12.66 |
| Hongfang Yu | 2 | 679 | 62.42 |
| Gang Sun | 3 | 463 | 36.98 |
| Liu Liu | 4 | 14 | 2.01 |