Show simple item record

dc.contributor.authorMijumbi, Rashid
dc.contributor.authorSerrat Fernández, Juan
dc.contributor.authorGorricho Moreno, Juan Luis
dc.contributor.authorBoutaba, Raouf
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.identifier.citationMijumbi, R., Serrat, J., Gorricho, J., Boutaba, R. A path generation approach to embedding of virtual networks. "IEEE transactions on network and service management", 21 Juliol 2015, vol. 12, núm. 3, p. 334-348.
dc.description© 2015 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.abstractAs the virtualization of networks continues to attract attention from both industry and academia, the virtual network embedding (VNE) problem remains a focus of researchers. This paper proposes a one-shot, unsplittable flow VNE solution based on column generation. We start by formulating the problem as a path-based mathematical program called the primal, for which we derive the corresponding dual problem. We then propose an initial solution which is used, first, by the dual problem and then by the primal problem to obtain a final solution. Unlike most approaches, our focus is not only on embedding accuracy but also on the scalability of the solution. In particular, the one-shot nature of our formulation ensures embedding accuracy, while the use of column generation is aimed at enhancing the computation time to make the approach more scalable. In order to assess the performance of the proposed solution, we compare it against four state of the art approaches as well as the optimal link-based formulation of the one-shot embedding problem. Experiments on a large mix of virtual network (VN) requests show that our solution is near optimal (achieving about 95% of the acceptance ratio of the optimal solution), with a clear improvement over existing approaches in terms of VN acceptance ratio and average substrate network (SN) resource utilization, and a considerable improvement (92% for a SN of 50 nodes) in time complexity compared to the optimal solution.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.othernetwork virtualization
dc.subject.otherresource allocation
dc.subject.othervirtual network embedding
dc.subject.othercolumn generation
dc.titleA path generation approach to embedding of virtual networks
dc.subject.lemacSistemes virtuals (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. MAPS - Management, Pricing and Services in Next Generation Networks
dc.rights.accessRestricted access - publisher's policy
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/318488/EU/Management of the Future Internet/FLAMINGO
local.citation.authorMijumbi, R.; Serrat, J.; Gorricho, J.; Boutaba, R.
local.citation.publicationNameIEEE transactions on network and service management

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain