Abstract
Service provisioning has been widely regarded as a critical issue to quality-of-service (QoS) of cloud services in datacenters. Conventional studies on service provisioning mainly focus on task mapping, i.e., how to distribute the service-oriented tasks onto the servers to achieve different goals, e.g., makespan minimization. In distributed datacenters, a task is usually routed from its generation point (i.e., control room) to the designated server within a datacenter network. Since the routing delay also has a deep influence on the task makespan, we are motivated to study how to minimize the maximum makespan of all tasks in a duty period by joint optimization of both task mapping and routing. It is formulated as an integer programming with quadratic constraints (IPQC) problem and proved as NP-hard. To tackle the computational complexity of solving IPQC, a heuristic algorithm with polynomial time is proposed. Extensive simulation results show that it performs close to the optimal one and outperforms existing algorithms significantly.
Original language | English |
---|---|
Title of host publication | 2014 IEEE International Conference on Communications, ICC 2014 |
Publisher | IEEE Computer Society |
Pages | 4196-4201 |
Number of pages | 6 |
ISBN (Print) | 9781479920037 |
DOIs | |
Publication status | Published - 1 Jan 2014 |
Externally published | Yes |
Event | 2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, NSW, Australia Duration: 10 Jun 2014 → 14 Jun 2014 |
Conference
Conference | 2014 1st IEEE International Conference on Communications, ICC 2014 |
---|---|
Country/Territory | Australia |
City | Sydney, NSW |
Period | 10/06/14 → 14/06/14 |
ASJC Scopus subject areas
- Computer Networks and Communications