direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

CloudNets

"ClowdNets are virtualized networks which can be run in parallel on top of a shared physical infrastructure. These CloudNets can have different properties (provide different security/QoS/… guarantees, run different protocols, etc.) and can be managed independently of each other. Moreover, (parts

of) a CloudNet can be migrated dynamically to locations where the service is most useful or most cost efficient (e.g., in terms of energy conservation). Depending on the circumstances and the technology, these migrations can be done live and without interrupting ongoing sessions. Furthermore CloudNets can be reprovisioned during their lifetimes to react to changing requirements or unforeseeable events.

 

The flexibility of the paradigm and the decoupling of the services from the underlying resource networks has many advantages; for example, it facilitates a more efficient use of the given resources, it promises faster innovations by overcoming the ossification of today's Internet architecture, it simplifies the network management, and it can improve service performance.

 

Currently, we address the problem of where to embed CloudNet requests, or find algorithms to migrate CloudNets to new locations (e.g., due to user mobility) taking into account the corresponding migration cost. The obtained insights are implemented in a MapReduce cluster to analyze the feasibility on real hardware. In particular the strategy to modify existing CloudNets has proven to be an interesting research question under certain consistency requirements. Moreover, the project has important economic dimensions (e.g., regarding pricing mechanisms)."

Selected Publications

Competitive and Deterministic Embeddings of Virtual Networks
Citation key EMSS-CDEVN-11
Author Even, Guy and Medina, Moti and Schaffrath, Gregor and Schmid, Stefan
Year 2011
Month January
Note ID arXiv:1101.5221 [cs.NI]
Institution arXiv
Abstract Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the problem of embedding dynamically arriving VNet requests. We describe a generic algorithm for the online VNet embedding problem and analyze its competitive ratio. This means that we compare the benefit accumulated by the algorithm with the benefit of an optimal offline algorithm. We prove that the competitive ratio of our online algorithm 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 allows for nonuniform benefits and durations of VNet requests. Concretely, the routing models considered in this paper include: multipaths, single paths, and tree routing. For modeling traffic, we study the customer-pipe model, the hose model, and a new traffic model, called aggregate ingress model, that is well suited for modeling multicasts and multi-party video conferences.
Bibtex Type of Publication Technical Report
Link to publication Link to original publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions