On-line path computation and function placement in SDNs
From MaRDI portal
Publication:5920222
DOI10.1007/s00224-018-9863-4zbMath1423.68046OpenAlexW2800139957WikidataQ129973184 ScholiaQ129973184MaRDI QIDQ5920222
Moti Medina, Boaz Patt-Shamir, Guy Even
Publication date: 21 June 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9863-4
Network design and communication in computer systems (68M10) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Competitive and deterministic embeddings of virtual networks
- An Approximation Algorithm for Path Computation and Function Placement in SDNs
- Online Multi-Commodity Flow with High Demands
- Online Primal-Dual Algorithms for Covering and Packing
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-line path computation and function placement in SDNs
- Competitive routing of virtual circuits with unknown duration
This page was built for publication: On-line path computation and function placement in SDNs