Semantic validation of affinity constrained service function chain requests
View/Open
07502414.pdf (1,117Mb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/97550
Document typeConference report
Defense date2016
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessRestricted access - publisher's policy
Abstract
Network Function Virtualization (NFV) has been proposed as a paradigm to increase the cost-efficiency, flexibility and innovation in network service provisioning. By leveraging IT virtualization techniques in combination with programmable networks, NFV is able to decouple network functionality from the physical devices on which they
are deployed. This opens up new business opportunities for both Infrastructure Providers (InPs) as well as Service Providers (SPs), where the SP can request to deploy a chain of Virtual Network Functions (VNFs) on top of which its service can run. However, current NFV approaches lack the possibility for SPs to define location requirements and constraints on the mapping of virtual functions and paths onto physical hosts and links. Nevertheless, many scenarios
can be envisioned in which the 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 SPs to define such placement restrictions. This newfound ability to add constraints to Service Function Chain (SFC) requests also introduces an additional risk that SFCs with conflicting constraints are requested or automatically
generated. Therefore, a framework is proposed that allows the InP to check the validity of a set of constraints and provide feedback to the SP. To achieve this, the SFC request and relevant information on the physical topology are modeled as an ontology of which the consistency can be checked using a semantic reasoner. Enabling semantic
validation of SFC requests, eliminates inconsistent SFCs requests from being transferred to the embedding algorithm.
CitationBouten, N., Claeys, M., Mijumbi, R., Famaey, J., Latré, S., Serrat, J. Semantic validation of affinity constrained service function chain requests. A: IEEE Conference on Network Softwarization. "2016 IEEE NetSoft Conference and Workshops (NetSoft 2016): Seoul, South Korea: 6-10 June 2016". Seoul: Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 202-210.
ISBN9781467394871
Publisher versionhttp://ieeexplore.ieee.org/document/7502414/
Files | Description | Size | Format | View |
---|---|---|---|---|
07502414.pdf![]() | 1,117Mb | Restricted access |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain