The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Cost minimization of network services with buffer and end-to-end deadline constraints

På svenska

Author

Summary, in English

Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing sensitive services. One such is virtual networking services, so called services chains, which consist of several interconnected virtual network functions. This allows for the capacity to be scaled up and down by adding or removing virtual resources. In this work, we develop a model of a service chain and pose the dynamic allocation of resources as an optimization problem. We design and present a set of strategies to allot virtual network nodes in an optimal fashion subject to latency and buffer constraints.

Publishing year

2016-09-20

Language

English

Publication/Series

Technical Reports TFRT-7648

Document type

Report

Publisher

Department of Automatic Control, Lund Institute of Technology, Lund University

Topic

  • Control Engineering

Status

Published

Project

  • Feedback Computing in Cyber-Physical Systems

Research group

  • LCCC

ISBN/ISSN/Other

  • ISSN: 0280-5316