--- res: bibo_abstract: - "Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. \r\nConsidering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands.@eng" bibo_authorlist: - foaf_Person: foaf_givenName: Stefan Balthasar foaf_name: Schneider, Stefan Balthasar foaf_surname: Schneider foaf_workInfoHomepage: http://www.librecat.org/personId=35343 orcid: 0000-0001-8210-4011 - foaf_Person: foaf_givenName: Sevil foaf_name: Dräxler, Sevil foaf_surname: Dräxler foaf_workInfoHomepage: http://www.librecat.org/personId=31764 - foaf_Person: foaf_givenName: Holger foaf_name: Karl, Holger foaf_surname: Karl foaf_workInfoHomepage: http://www.librecat.org/personId=126 dct_date: 2018^xs_gYear dct_language: eng dct_publisher: IEEE@ dct_title: Trade-offs in Dynamic Resource Allocation in Network Function Virtualization@ ...