Minimum congestion mapping in a cloud
Nikhil Bansal, Kang‐Won Lee, Viswanath Nagarajan, Murtaza A. Zafer · 2011
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.