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.

SLA adaptation for service overlay networks

Author

  • Con Tran
  • Zbigniew Dziong
  • Michal Pioro

Summary, in English

Virtual Network Operators lease bandwidth from different data carriers to offer well managed Virtual Private Networks. By using proprietary algorithms and leased resource diversity they can offer Quality of Service, at competitive prices, which is difficult to attain from traditional data network operators. Since maximizing the profit is a key objective for virtual network operators, in this paper we describe a novel resource management approach, based on an economic model that allows continuous optimizing of the network profit, while keeping network blocking constraints. The approach integrates leased link capacity adaptations with connection admission control and routing policies by using concepts derived from Markov Decision Process theory. Our numerical analysis validates the approach and shows that the profit can be maximized under varying network conditions.

Publishing year

2007

Language

English

Pages

691-702

Publication/Series

NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Intern / Lecture Notes in Computer Science

Volume

4479

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Resource Management
  • Economic Model
  • Service Overlay Network
  • Quality of Service
  • Markov Decision Process

Conference name

6th International IFIP-TC6 Networking Conference

Conference date

2007-05-14 - 2007-05-18

Conference place

Atlanta, GA, United States

Status

Published

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349