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

Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Citation key ABFSS-OSIIPSMVN-11
Author Arora, Dushyant and Bienkowski, Marcin and Feldmann, Anja and Schaffrath, Gregor and Schmid, Stefan
Title of Book Proceedings of Principles, Systems and Applications of IP Telecommunications (IPTComm '11)
Pages 1–11
Year 2011
ISBN 978-1-60558-606-9
Location Chicago, IL, USA
Address New York, NY, USA
Month August
Note Also published as technical report arXiv:1103.0966.
Publisher ACM
Organization ACM
Abstract Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully exploit the benefits of this new technology, protocols need to be devised which react efficiently to changes in the demand. This paper argues that the field of online algorithms and competitive analysis provides useful tools to deal with and reason about the uncertainty in the request dynamics, and to design algorithms with provable performance guarantees. As a case study, we describe a system (e.g., a gaming application) where network virtualization is used to support thin client applications for mobile devices to improve their QoS. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration cost. This paper identifies the major cost factors in such a system, and formalizes the corresponding optimization problem. Both randomized and deterministic, gravity center based online algorithms are presented which achieve a good tradeoff between improved QoS and migration cost in the worst-case, both for service migration within an infrastructure provider as well as for networks supporting cross-provider migration. The paper reports on our simulation results and also presents an explicit construction of an optimal offline algorithm which allows, e.g., to evaluate the competitive ratio empirically.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions