Journal of Software, Vol 6, No 12 (2011), 2472-2478, Dec 2011
doi:10.4304/jsw.6.12.2472-2478

A Comprehensive Optimization Model Based on Time and Cost Constraints for Resource Selection in Data Grid

Mingcheng Qu, Xiang-hu Wu, Xiao-zong Yang

Abstract


Parallel data transmission based on multi-copy can enhance transmission speed and ensure the QoS of data grid greatly. The status of network and replica node, the distance of replica node, the time and bandwidth of service requester will directly affect service cost. How to take the above factors into account, so as to provide basis for node selection and bandwidth allocation, guarantee the time constraint of service requestor and optimize service cost is a key problem need to be solved urgently. Based on ‘0-1’ integer programming and linear programming methods, respectively, a minimum transfer time model, minimum cost model and comprehensive optimization model are proposed to solve the above problem. Simulative experiments show that the models are correct and effective.


Keywords


resource selection optimization model, transmission time constraint, parallel data transmission, data grid, QoS

References


[1] Esther Pacitti. Patrick Valduriez. Marta Mattoso. Grid Data Management: Open Problems and New Issues. Journal of Grid Computing. 2007, 5:273–281
http://dx.doi.org/10.1007/s10723-007-9081-9

[2] Tim Ho, David Abramson. A Unified Data Grid Replication Framework. Proceedings of the Second IEEE International Conference on e-Science and Grid Computing: IEEE Computer Society, 2006:1-8

[3] Pangfeng Liu. Jan-Jan Wu, Optimal Replica Placement Strategy for Hierarchical Data Grid Systems. Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid:IEEE Computer Society, 2006:1-4

[4] William Allcock, John Bresnahan, et al. The Globus Striped GridFTP Framework and Server. Proceedings of the 2005 ACM/IEEE SC|05 Conference. Seattle, WA, USA:IEEE Computer Society, 2005, 1-11.

[5] Jun Feng, Lingling Cui, et al. Toward Seamless Grid Data Access: Design and Implementation of GridFTP on. NET. The 6th IEEE/ACM International Workshop. Vienna University of Technology, Austria:IEEE Computer Society, 2005,1-8.

[6] Chao-Tung Yang, I-Hsien Yang, Kuan-Ching Li. A Recursive-Adjustment Co-allocation Scheme in Data Grid Environments. ICA3PP 2005, LNCS 3719. 2005:1-10

[7] Chao-Tung Yang, I-Hsien Yang and Kuan-Ching Li. Improvements on dynamic adjustment mechanism in co-allocation data grid environments. J Supercomput,2007,40:269-280
http://dx.doi.org/10.1007/s11227-006-0022-3

[8] Chao-Tung Yang, Shih-YuWang, William Cheng-Chung Chu. Implementation of a dynamic adjustment strategy for parallel file transfer in co-allocation data grids. J Supercomput,2010,54:180-205
http://dx.doi.org/10.1007/s11227-009-0307-4

[9] Dafei Yin, Bin Chen, Yu Fang. A Fast Replica Selection Algorithm for Data Grid. 31st Annual International Computer Software and Applications Conference(COMPSAC 2007), IEEE, computer society, 2007:1-4

[10] Gaurav K, Umit C, Tahsin K, et al. A Dynamic Scheduling Approach for Coordinated Wide-Area Data Transfers using GridFTP. PARALLEL AND DISTRIBUTED SYSTEM, 2008,1-12

[11] Husni Hamad E. AL-Mistarihi and Chan Huah Yong. Response Time Optimization for Replica Selection Service in Data Grids. Journal of Computer Science,2008,4(6):487-493
http://dx.doi.org/10.3844/jcssp.2008.487.493


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2012 by ACADEMY PUBLISHER – All rights reserved.