Joint optimization of task mapping and routing for service provisioning in distributed datacenters

Huawei Huang, Deze Zeng, Song Guo, Hong Yao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

7 Citations (Scopus)

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 languageEnglish
Title of host publication2014 IEEE International Conference on Communications, ICC 2014
PublisherIEEE Computer Society
Pages4196-4201
Number of pages6
ISBN (Print)9781479920037
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, NSW, Australia
Duration: 10 Jun 201414 Jun 2014

Conference

Conference2014 1st IEEE International Conference on Communications, ICC 2014
Country/TerritoryAustralia
CitySydney, NSW
Period10/06/1414/06/14

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this