Virtual machine placement for minimizing connection cost in data center networks

DOI10.1016/j.disopt.2017.05.004zbMath1387.90048OpenAlexW2730756806MaRDI QIDQ1751257

Hiyori Yoshikawa, Takuro Fukunaga, Shuichi Hirahara

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.05.004

zbMATH Keywords

optimizationnetwork designvirtualizationdata center operation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (1)

A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines

Cites Work

• The Steiner tree problem on graphs: inapproximability results
• Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
• Saving an epsilon
• On the optimal allocation of virtual resources in cloud computing networks
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Virtual machine placement for minimizing connection cost in data center networks