Show simple item record

dc.contributor.authorBouten, Niels
dc.contributor.authorMijumbi, Rashid
dc.contributor.authorSerrat Fernández, Juan
dc.contributor.authorFamaey, Jeroen
dc.contributor.authorLatré, Steven
dc.contributor.authorDe Turck, Filip
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.date.accessioned2018-01-26T13:54:26Z
dc.date.available2018-01-26T13:54:26Z
dc.date.issued2017-06-01
dc.identifier.citationBouten, 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", 1 Juny 2017, vol. 14, núm. 2, p. 317-331.
dc.identifier.issn1932-4537
dc.identifier.urihttp://hdl.handle.net/2117/113270
dc.description© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.description.abstractNetwork 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.
dc.format.extent15 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Internet
dc.subject.lcshCloud computing
dc.subject.lcshInternet (Computer network)
dc.subject.otherNetwork function virtualization
dc.subject.otherSoftware defined networking
dc.subject.otherSemantic technology
dc.titleSemantically enhanced mapping algorithm for affinity-constrained service function chain requests
dc.typeArticle
dc.subject.lemacComputació en núvol
dc.subject.lemacInternet
dc.contributor.groupUniversitat Politècnica de Catalunya. MAPS - Management, Pricing and Services in Next Generation Networks
dc.identifier.doi10.1109/TNSM.2017.2681025
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/7875160/
dc.rights.accessOpen Access
local.identifier.drac21138704
dc.description.versionPostprint (published version)
local.citation.authorBouten, N.; Mijumbi, R.; Serrat, J.; Famaey, J.; Latré, S.; De Turck, F.
local.citation.publicationNameIEEE transactions on network and service management
local.citation.volume14
local.citation.number2
local.citation.startingPage317
local.citation.endingPage331


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder