Paper Info
Title
Generating random service function chain embedding problems
Abstract
The combination of Software Defined Networking (SDN) and Network Function Virtualization (NFV) promises to provide highly flexible and configurable network infrastructures. This relies, however, on an efficient assignment of the respective Service Function Chain (SFC). This is related to Virtual Network Embedding (VNE), where algorithms are devised to provide such an assignment. To evaluate and compare the efficiency of such algorithms, well-designed embedding problems have to be generated. This paper presents a new mechanism for generating embedding problems: Problems are generated from a given set of SFCs such that each generated problem is known in advance to have an optimal solution. Experimenters can use this approach to investigate specific properties of embedding algorithms. The approach, thereby, facilitates more detailed evaluation.
Year
DOI
Venue
2017
10.1109/NFV-SDN.2017.8169834
2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)
Keywords
Field
DocType
SDN,NFV,highly flexible network,efficient assignment,well-designed embedding problems,generated problem,embedding algorithms,software defined networking,network function virtualization,virtual network embedding,random service function chain embedding problem generation,configurable network infrastructures,VNE,SFC
Algorithm design,Embedding,Computer science,Network Functions Virtualization,Software-defined networking,Virtual network embedding,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-5386-3286-4
1
0.35
References 
Authors
16
1
Name
Order
Citations
PageRank
Andreas Fischer160528.11