Wireless Networks
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Designing least-cost nonblocking broadband networks
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Recent results on approximating the Steiner tree problem and its generalizations
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Competitive routing of virtual circuits with unknown duration
Journal of Computer and System Sciences
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Sequential and Parallel Algorithms for Mixed Packing and Covering
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
IEEE/ACM Transactions on Networking (TON)
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Hardness of robust network design
Networks
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Network virtualization architecture: proposal and initial prototype
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
IEEE Transactions on Information Theory
Design of trees in the hose model: The balanced case
Operations Research Letters
Hi-index | 5.23 |
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 article 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.