Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Combinatorial optimization
Online computation and competitive analysis
Online computation and competitive analysis
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
MaxMin allocation via degree lower-bounded arborescences
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms (TALG)
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Remedy: network-aware steady state VM management for data centers
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Embedding paths into trees: VM placement to minimize congestion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
International Journal of Web and Grid Services
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
Firewall placement in cloud data centers
Proceedings of the 4th annual Symposium on Cloud Computing
Resource allocation with multi-factor node ranking in data center networks
Future Generation Computer Systems
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
IEEE/ACM Transactions on Networking (TON)
A new virtual network static embedding strategy within the Cloud's private backbone network
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We study a basic resource allocation problem that arises in cloud computing environments. The physical network of the cloud is represented as a graph with vertices denoting servers and edges corresponding to communication links. A workload is a set of processes with processing requirements and mutual communication requirements. The workloads arrive and depart over time, and the resource allocator must map each workload upon arrival to the physical network. We consider the objective of minimizing the congestion. We show that solving a subproblem about mapping a single workload to the physical graph essentially suffices to solve the general problem. In particular, an α-approximation for this single mapping problem gives an O(α log nD)-competitive algorithm for the general problem, where n is the number of nodes in the physical network and D is the maximum to minimum workload duration ratio. We also show how to solve the single mapping problem for two natural class of workloads, namely depth-d-trees and complete-graph workloads. For depth-d tree, we give an nO(d) time O(d2 log (nd))-approximation based on a strong LP relaxation inspired by the Sherali-Adams hierarchy.