A forwarding graph embedding algorithm exploiting regional topology information

Network function virtualization (NFV) is a newly proposed technique designed to construct and manage network functions dynamically and efficiently. Allocating physical resources to the virtual network function forwarding graph is a critical issue in NFV. We formulate the forwarding graph embedding (...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Frontiers of information technology & electronic engineering Ročník 18; číslo 11; s. 1854 - 1866
Hlavní autoři: Hu, Hong-chao, Zhang, Fan, Mao, Yu-xing, Wang, Zhen-peng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hangzhou Zhejiang University Press 01.11.2017
Springer Nature B.V
Témata:
ISSN:2095-9184, 2095-9230
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network function virtualization (NFV) is a newly proposed technique designed to construct and manage network functions dynamically and efficiently. Allocating physical resources to the virtual network function forwarding graph is a critical issue in NFV. We formulate the forwarding graph embedding (FGE) problem as a binary integer programming problem, which aims to increase the revenue and decrease the cost to a service provider (SP) while considering limited network resources and the requirements of virtual functions. We then design a novel regional resource clustering metric to quantify the embedding potential of each substrate node and propose a topology-aware FGE algorithm called ‘regional resource clustering FGE’ (RRC-FGE). After implementing our algorithms in C++, simulation results showed that the total revenue was increased by more than 50 units and the acceptance ratio by more than 15%, and the cost of the service provider was decreased by more than 60 units.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2095-9184
2095-9230
DOI:10.1631/FITEE.1601404