Competitive and deterministic embeddings of virtual networks

Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Network virtualization is an important concept to overcome the ossification of today's Internet as it facilitates innovation also in the network core and as it promises a more efficient use of the given resources and infrastructure. Virtual networks (VNets) provide an abstraction of the physical network: multiple VNets may cohabit the same physical network, but can be based on completely different protocol stacks (also beyond IP). One of the main challenges in network virtualization is the efficient admission control and embedding of VNets. The demand for virtual networks (e.g., for a video conference) can be hard to predict, and once the request is accepted, the specification / QoS guarantees must be ensured throughout the VNet's lifetime. This requires an admission control algorithm which only selects high-benefit VNets in times of scarce resources, and an embedding algorithm which realizes the VNet in such a way that the likelihood that future requests can be embedded as well is maximized. This paper describes a generic algorithm for the online VNet embedding problem which does not rely on any knowledge of the future VNet requests but whose performance is competitive to an optimal offline algorithm that has complete knowledge of the request sequence in advance: the so-called competitive ratio is, loosely speaking, logarithmic in the sum of the resources. Our algorithm is generic in the sense that it supports multiple traffic models, multiple routing models, and even allows for nonuniform benefits and durations of VNet requests.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 13th International Conference, ICDCN 2012, Proceedings
Pages106-121
Number of pages16
DOIs
StatePublished - 2012
Event13th International Conference on Distributed Computing and Networking, ICDCN 2012 - Hong Kong, China
Duration: 3 Jan 20126 Jan 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7129 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Distributed Computing and Networking, ICDCN 2012
Country/TerritoryChina
CityHong Kong
Period3/01/126/01/12

Fingerprint

Dive into the research topics of 'Competitive and deterministic embeddings of virtual networks'. Together they form a unique fingerprint.

Cite this