Competitive and Deterministic Embeddings of Virtual Networks
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid

TL;DR
This paper presents a competitive online algorithm for embedding virtual networks that maximizes resource utilization and supports diverse traffic, routing, and benefit models without future request knowledge.
Contribution
It introduces a generic, deterministic online embedding algorithm with a competitive ratio logarithmic in resource sum, applicable to various network virtualization scenarios.
Findings
Algorithm is competitive with offline optimal
Supports multiple traffic and routing models
Handles nonuniform benefits and durations
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
