On the difficulty of virtual private network instances

DOI10.1002/NET.21548MaRDI QIDQ4642482zbMATH OpenOpenAlexFDO

Authors Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21548

zbMATH Keywords

capacity reservation and utilizationduality gaphose modelprovisioningroutingtraffic uncertaintyvirtual private network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Virtual private network design over the first Chvátal closure
• Experiments on virtual private network design with concave capacity costs
• Virtual private network design
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Automata, Languages and Programming

Cited in

(3)

• Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
• Virtual private network design over the first Chvátal closure
• Experiments on virtual private network design with concave capacity costs

This page was built for publication: On the difficulty of virtual private network instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642482)