Cost and Time Aware Ant Colony Algorithm for Data Replica in Alpha Magnetic Spectrometer Experiment

Huge collections of data have been created in recent years. Cloud computing provides a way to enable massive amounts of data to work together as data-intensive services. Considering Big Data and the cloud together, which is a practical and economical way to deal with Big Data, will accelerate the availability and acceptability of analysis of the data. Providing an efficient mechanism for optimized data-intensive services will become critical to meet the expected growth in demand. Because the competition is an extremely important factor in the marketplace, the cost model for data-intensive service provision is the key to provide a sustainable service market. As data play the dominant role in execution of data-intensive service composition, the cost and access response time of data sets influence the quality of the service that requires the data sets. In this paper, a data replica selection optimization algorithm based on an ant colony system is proposed. The performance of the data replica selection algorithm is evaluated by simulations. The background application of the work is the Alpha Magnetic Spectrometer experiment, which involves large amounts of data being transferred, organized and stored. It is critical and challenging to be cost and time aware to manage the data and services in this intensive research environment.

[1]  Lijuan Wang,et al.  A survey on bio-inspired algorithms for web service composition , 2012, Proceedings of the 2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[2]  Jun Shen,et al.  Incremental service level agreements violation handling with time impact analysis , 2013, J. Syst. Softw..

[3]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

[4]  Javier Jaén Martínez,et al.  Data Management in an International Data Grid Project , 2000, GRID.

[5]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[6]  Chan Huah Yong,et al.  Response Time Optimization for Replica Selection Service in Data Grids , 2008 .

[7]  F SchwartzMichael,et al.  Locating nearby copies of replicated Internet servers , 1995 .

[8]  Yu Hu,et al.  GRESS - a Grid Replica Selection Service , 2003, ISCA PDCS.

[9]  Enrique Castro-Leon,et al.  Power-Aware Management in Cloud Data Centers , 2009, CloudCom.

[10]  M. Makpangou,et al.  A scalable replica selection strategy based on flexible contracts , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[11]  Jun Shen,et al.  Towards Bio-inspired Cost Minimisation for Data-Intensive Service Provision , 2012, 2012 IEEE First International Conference on Services Economics.

[12]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[15]  Ghassan Beydoun,et al.  Comparison of Bio-inspired Algorithms for Peer Selection in Services Composition , 2011, 2011 IEEE International Conference on Services Computing.

[16]  J. Niemoller,et al.  Cost Control in Service Composition Environments , 2008, 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies.

[17]  Ching-Lai Hwang,et al.  Multiple attribute decision making : an introduction , 1995 .

[18]  Ian T. Foster,et al.  Replica selection in the Globus Data Grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[19]  Fabio Casati,et al.  Developing E-Services for Composing E-Services , 2001, CAiSE.

[20]  Fang Dong,et al.  An effective data aggregation based adaptive long term CPU load prediction mechanism on computational grid , 2012, Future Gener. Comput. Syst..

[21]  Yan Li,et al.  Towards minimizing cost for composite data-intensive services , 2013, Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[22]  David Abramson,et al.  The GriddLeS data replication service , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[23]  Markus Winter,et al.  Data Center Consolidation: A Step towards Infrastructure Clouds , 2009, CloudCom.

[24]  Daniel J. Abadi,et al.  Data Management in the Cloud: Limitations and Opportunities , 2009, IEEE Data Eng. Bull..

[25]  رفاه محمد كاظم المطيري.  New Replica Selection Technique for Binding Replica Sites in Data Grids , 2015 .

[26]  Reda Alhajj,et al.  Replica selection strategies in data grid , 2008, J. Parallel Distributed Comput..

[27]  Peter Scheuermann,et al.  Selection algorithms for replicated Web servers , 1998, PERV.

[28]  Hui Wang,et al.  Multi-Tiered On-Demand Resource Scheduling for VM-Based Data Center , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[29]  Margo I. Seltzer,et al.  The case for geographical push-caching , 1995, Proceedings 5th Workshop on Hot Topics in Operating Systems (HotOS-V).

[30]  Niloy Ganguly,et al.  A new bio-inspired location search algorithm for peer to peer network based Internet telephony , 2006, 2006 1st Bio-Inspired Models of Network, Information and Computing Systems.

[31]  Ruay-Shiung Chang,et al.  Complete and fragmented replica selection and retrieval in Data Grids , 2007, Future Gener. Comput. Syst..

[32]  Reda Alhajj,et al.  A Predictive Technique for Replica Selection in Grid Environment , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[33]  Félix García Carballeira,et al.  Emergent algorithms for replica location and selection in data grid , 2010, Future Gener. Comput. Syst..

[34]  Floriano Zini,et al.  Evaluation of an economy-based file replication strategy for a data grid , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[35]  Peter Scheuermann,et al.  Content replication in Web++ , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[36]  Jizhou Sun,et al.  Ant Algorithm for File Replica Selection in Data Grid , 2005, 2005 First International Conference on Semantics, Knowledge and Grid.

[37]  Srikumar Venugopal,et al.  A Set Coverage-based Mapping Heuristic for Scheduling Distributed Data-Intensive Applications on Global Grids , 2006, 2006 7th IEEE/ACM International Conference on Grid Computing.

[38]  Ian T. Foster,et al.  A decentralized, adaptive replica location mechanism , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.