Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Publiceringsår

2016-09-20

Språk

Engelska

Publikation/Tidskrift/Serie

Technical Reports TFRT-7648

Dokumenttyp

Rapport

Förlag

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

Ämne

  • Control Engineering

Status

Published

Projekt

  • Feedback Computing in Cyber-Physical Systems

Forskningsgrupp

  • LCCC

ISBN/ISSN/Övrigt

  • ISSN: 0280-5316