Minimum congestion mapping in a cloud

DOI10.1137/110845239MaRDI QIDQ5258917zbMATH OpenOpenAlexFDO

Authors N. Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer

Publication date 24 June 2015

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc

zbMATH Keywords

approximation algorithmscloud computinggraph mappingcongestion minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Minimum congestion mapping in a cloud
• Embedding paths into trees: VM placement to minimize congestion
• Dynamic resource allocation in the cloud with near-optimal efficiency
• Optimal mapping of cloud virtual machines
• An infinite server system with general packing constraints

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 714527 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Approximating the minimum quadratic assignment problems
• Expander flows, geometric embeddings and graph partitioning
• Graph expansion and the unique games conjecture
• Min-max Graph Partitioning and Small Set Expansion
• Minimum congestion mapping in a cloud
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On the maximum quadratic assignment problem
• On-Line Load Balancing for Related Machines
• On-Line Load Balancing of Temporary Tasks
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Quorum placement in networks, minimizing network congestion
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The quadratic assignment problem. Theory and algorithms

Cited in

(4)

• Embedding paths into trees: VM placement to minimize congestion
• Max-cut under graph constraints
• Approximating graph-constrained max-cut
• Minimum congestion mapping in a cloud

This page was built for publication: Minimum congestion mapping in a cloud

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