Embedding paths into trees: VM placement to minimize congestion

DOI10.1007/978-3-642-33090-2_38MaRDI QIDQ2912862zbMATH OpenOpenAlexFDO

Authors Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde

Publication date 25 September 2012

Published in Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33090-2_38

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Virtual machine placement for minimizing connection cost in data center networks
• Minimum congestion mapping in a cloud
• Minimum congestion mapping in a cloud
• Virtual network embedding in the cycle
• Topology-aware VM migration in bandwidth oversubscribed datacenter networks

Cited in

(4)

• Minimum congestion mapping in a cloud
• Virtual machine placement for minimizing connection cost in data center networks
• Topology-aware VM migration in bandwidth oversubscribed datacenter networks
• Minimum congestion mapping in a cloud

This page was built for publication: Embedding paths into trees: VM placement to minimize congestion

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