Advanced search
1 file | 1.92 MB

Semantically enhanced mapping algorithm for affinity-constrained service function chain requests

Author
Organization
Abstract
Network function virtualization (NFV) and software defined networking (SDN) have been proposed to increase the cost-efficiency, flexibility, and innovation in network service provisioning. This is achieved by leveraging IT virtualization techniques and combining them with programmable networks. By doing so, NFV and SDN are able to decouple the network functionality from the physical devices on which they are deployed. Service function chains (SFCs) composed out of virtual network functions (VNFs) can now be deployed on top of the virtualized infrastructure to create new value-added services. Current NFV approaches are limited to mapping the different VNF to the physical substrate subject to resource capacity constraints. They do not provide the possibility to define location requirements with a certain granularity and constraints on the colocation of VNF and virtual edges. Nevertheless, many scenarios can be envisioned in which a service provider (SP) would like to attach placement constraints for efficiency, resilience, legislative, privacy, and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SP to define such placement restrictions. Furthermore, a semantic SFC validation framework is proposed that allows the virtual network function infrastructure provider (VNFInP) to check the validity of a set of constraints and provide feedback to the SPs. This allows the VNFInP to filter out any non-valid SFC requests before sending them to the mapping algorithm, significantly reducing the mapping time.
Keywords
IBCN

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.92 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Bouten, Niels, Rashid Mijumbi, Joan Serrat, Jeroen Famaey, Steven Latré, and Filip De Turck. 2017. “Semantically Enhanced Mapping Algorithm for Affinity-constrained Service Function Chain Requests.” Ieee Transactions on Network and Service Management 14 (2): 317–331.
APA
Bouten, N., Mijumbi, R., Serrat, J., Famaey, J., Latré, S., & De Turck, F. (2017). Semantically enhanced mapping algorithm for affinity-constrained service function chain requests. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 14(2), 317–331.
Vancouver
1.
Bouten N, Mijumbi R, Serrat J, Famaey J, Latré S, De Turck F. Semantically enhanced mapping algorithm for affinity-constrained service function chain requests. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. 2017;14(2):317–31.
MLA
Bouten, Niels, Rashid Mijumbi, Joan Serrat, et al. “Semantically Enhanced Mapping Algorithm for Affinity-constrained Service Function Chain Requests.” IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 14.2 (2017): 317–331. Print.
@article{8541178,
  abstract     = {Network function virtualization (NFV) and software defined networking (SDN) have been proposed to increase the cost-efficiency, flexibility, and innovation in network service provisioning. This is achieved by leveraging IT virtualization techniques and combining them with programmable networks. By doing so, NFV and SDN are able to decouple the network functionality from the physical devices on which they are deployed. Service function chains (SFCs) composed out of virtual network functions (VNFs) can now be deployed on top of the virtualized infrastructure to create new value-added services. Current NFV approaches are limited to mapping the different VNF to the physical substrate subject to resource capacity constraints. They do not provide the possibility to define location requirements with a certain granularity and constraints on the colocation of VNF and virtual edges. Nevertheless, many scenarios can be envisioned in which a service provider (SP) would like to attach placement constraints for efficiency, resilience, legislative, privacy, and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SP to define such placement restrictions. Furthermore, a semantic SFC validation framework is proposed that allows the virtual network function infrastructure provider (VNFInP) to check the validity of a set of constraints and provide feedback to the SPs. This allows the VNFInP to filter out any non-valid SFC requests before sending them to the mapping algorithm, significantly reducing the mapping time.},
  author       = {Bouten, Niels and Mijumbi, Rashid and Serrat, Joan and Famaey, Jeroen and Latr{\'e}, Steven and De Turck, Filip},
  issn         = {1932-4537},
  journal      = {IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT},
  language     = {eng},
  number       = {2},
  pages        = {317--331},
  title        = {Semantically enhanced mapping algorithm for affinity-constrained service function chain requests},
  url          = {http://dx.doi.org/10.1109/TNSM.2017.2681025},
  volume       = {14},
  year         = {2017},
}

Altmetric
View in Altmetric
Web of Science
Times cited: