Competitive and deterministic embeddings of virtual networks
From MaRDI portal
Publication:391268
DOI10.1016/j.tcs.2012.10.036zbMath1294.68034OpenAlexW2019687840MaRDI QIDQ391268
Moti Medina, Stefan Schmid, Gregor Schaffrath, Guy Even
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.036
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Linear programming (90C05) Network design and communication in computer systems (68M10) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)
Related Items
Online Admission Control and Embedding of Service Chains ⋮ On-line path computation and function placement in SDNs ⋮ Adversarial topology discovery in network virtualization environments: a threat for ISPs?
Cites Work
- Unnamed Item
- Unnamed Item
- Design of trees in the hose model: the balanced case
- A survey of network virtualization
- Recent results on approximating the Steiner tree problem and its generalizations
- Online Multi-Commodity Flow with High Demands
- An improved LP-based approximation for steiner tree
- Minimum congestion mapping in a cloud
- Online Primal-Dual Algorithms for Covering and Packing
- Simpler and better approximation algorithms for network design
- Network Design via Core Detouring for Problems without a Core
- Hardness of robust network design
- Designing Least-Cost Nonblocking Broadband Networks
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Network information flow
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Algorithms – ESA 2005
- Competitive routing of virtual circuits with unknown duration
