Nowadays the development of Grid/Cloud networks has accelerated to meet the increasing requirements for large-scale computing, storage and network capabilities by consumers. Therefore how to improve the resource utilization in the Grid/Cloud to satisfy more task requests from users is becoming important. The objective of our investigation in this paper is to minimize the expense the consumers incur while obtaining the resources they request from Grid/Cloud networks. We propose a Tabu search based heuristic to solve joint resource allocation and task scheduling problem in Grid/Cloud networks, and examine the performance of the proposed method. The experimental results are analyzed and compared with the Best-Fit method we proposed in our earlier work. The results show that the Tabu search based heuristic method will equal or outperform the Best-Fit heuristic, and both can achieve approximate optimal solutions to the corresponding MILP (Mixed Integer Linear Programming) solutions. In addition, compared to the Best-Fit method, the Tabu search based heuristic will reduce the traffic blocking rate by 4%~30% generally under different job scheduling policies.
[1]
Byrav Ramamurthy,et al.
CAPEX optimized routing for scheduled traffic in multi-layer optical networks
,
2013,
2013 19th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN).
[2]
T. V. Lakshman,et al.
Network aware resource allocation in distributed clouds
,
2012,
2012 Proceedings IEEE INFOCOM.
[3]
Fred W. Glover,et al.
Tabu Search
,
1997,
Handbook of Heuristics.
[4]
Byrav Ramamurthy,et al.
Budget-Minimized Resource Allocation and Task Scheduling in Distributed Grid/Clouds
,
2013,
2013 22nd International Conference on Computer Communication and Networks (ICCCN).
[5]
Ulas C. Kozat,et al.
Dynamic resource allocation and power management in virtualized data centers
,
2010,
2010 IEEE Network Operations and Management Symposium - NOMS 2010.
[6]
Judith Kelner,et al.
Resource allocation for distributed cloud: concepts and research challenges
,
2011,
IEEE Network.