Online Admission Control and Embedding of Service Chains

DOI10.1007/978-3-319-25258-2_8zbMath1471.68026arXiv1506.04330OpenAlexW1651984967MaRDI QIDQ3460710

Tamás Lukovszki, Stefan Schmid

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.04330

zbMATH Keywords

competitive analysisvirtual circuit routingnetwork virtualizationcomputer networksonline call admission

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items

On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations, Walking through waypoints, An Approximation Algorithm for Path Computation and Function Placement in SDNs, Service chain placement in SDNs

Uses Software

• Merlin
• OpenNF

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive and deterministic embeddings of virtual networks
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
• Optimization, approximation, and complexity classes
• Derandomized graph products
• On the complexity of approximating \(k\)-set packing
• A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations