Show simple item record

dc.contributor.authorMijumbi, Rashid
dc.contributor.authorSerrat Fernández, Juan
dc.contributor.authorGorricho Moreno, Juan Luis
dc.contributor.authorBouten, Niels
dc.contributor.authorDe Turck, Filip
dc.contributor.authorDavy, Steven
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.date.accessioned2016-04-19T11:53:25Z
dc.date.issued2015
dc.identifier.citationMijumbi, R., Serrat, J., Gorricho, J., Bouten, N., De Turck, F., Davy, S. Design and evaluation of algorithms for mapping and scheduling of virtual network functions. A: IEEE Conference on Network Softwarization. "Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft)". Londres: 2015, p. 1-9.
dc.identifier.isbn978-1-4799-7898-4
dc.identifier.urihttp://hdl.handle.net/2117/85895
dc.description.abstractNetwork function virtualization has received attention from both academia and industry as an important shift in the deployment of telecommunication networks and services. It is being proposed as a path towards cost efficiency, reduced time-to-markets, and enhanced innovativeness in telecommunication service provisioning. However, efficiently running virtualized services is not trivial as, among other initialization steps, it requires first mapping virtual networks onto physical networks, and thereafter mapping and scheduling virtual functions onto the virtual networks. This paper formulates the online virtual function mapping and scheduling problem and proposes a set of algorithms for solving it. Our main objective is to propose simple algorithms that may be used as a basis for future work in this area. To this end, we propose three greedy algorithms and a tabu search-based heuristic. We carry out evaluations of these algorithms considering parameters such as successful service mappings, total service processing times, revenue, cost etc, under varying network conditions. Simulations show that the tabu search-based algorithm performs only slightly better than the best greedy algorithm.
dc.format.extent9 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.lcshComputer networks
dc.subject.otherNetwork function virtualization
dc.subject.othermapping
dc.subject.otherscheduling
dc.subject.otherplacement
dc.subject.otherchaining
dc.subject.othertabu search
dc.subject.otherresource allocation
dc.titleDesign and evaluation of algorithms for mapping and scheduling of virtual network functions
dc.typeConference report
dc.subject.lemacOrdinadors, Xarxes d'
dc.contributor.groupUniversitat Politècnica de Catalunya. MAPS - Management, Pricing and Services in Next Generation Networks
dc.identifier.doi10.1109/NETSOFT.2015.7116120
dc.identifier.dlIEEE Catalog Number CFP15A76-USB
dc.relation.publisherversionhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7116120
dc.rights.accessRestricted access - publisher's policy
drac.iddocument16610711
dc.description.versionPostprint (author's final draft)
dc.date.lift10000-01-01
upcommons.citation.authorMijumbi, R.; Serrat, J.; Gorricho, J.; Bouten, N.; De Turck, F.; Davy, S.
upcommons.citation.contributorIEEE Conference on Network Softwarization
upcommons.citation.pubplaceLondres
upcommons.citation.publishedtrue
upcommons.citation.publicationNameProceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft)
upcommons.citation.startingPage1
upcommons.citation.endingPage9


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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