A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids

Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lower energy costs. As a result, there are efforts worldwide to design more efficient data replication algorithms. Such replication algorithm for grids is further complicated by the fact that the different sites in a grid system are likely to have different ownerships with their own self interest and priorities. As such, any replication algorithm that simply aims to minimize total job delays are likely to fail in grids. Further, a grid differs from traditional high performance computing systems in the heterogeneity of the communication links that connect the different nodes together. In this paper, we propose a distributed, non-cooperative game theoretic approach to the data replication problem in grids. Our proposed replication scheme directly takes into account the self interest and priorities of the different providers in a grid, and maximizes the utility of each provider individually. Experiments were conducted to show the applicability of the proposed approaches. One advantage of our scheme is the relatively low overhead and robust performance against inaccuracies in performance prediction information.

[1]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[2]  Eitan Altman,et al.  Generalized Nash Bargaining Solution for bandwidth allocation , 2006, Comput. Networks.

[3]  Ratul Mahajan,et al.  Experiences applying game theory to system design , 2004, PINS '04.

[4]  N. Nisan,et al.  Globally distributed computation over the Internet-the POPCORN project , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[5]  Richard Wolski,et al.  G-commerce: market formulations controlling resource allocation on the computational grid , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[6]  David Abramson,et al.  Nimrod/G: an architecture for a resource management and scheduling system in a global computational grid , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[7]  Sajal K. Das,et al.  A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems , 2007, IEEE Transactions on Parallel and Distributed Systems.

[8]  Albert Y. Zomaya,et al.  Game-Theoretic Approach for Load Balancing in Computational Grids , 2008, IEEE Transactions on Parallel and Distributed Systems.

[9]  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..

[10]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Srinivasan Seshan,et al.  Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP , 2002, SIGCOMM '02.

[12]  Pattie Maes,et al.  Challenger: a multi-agent system for distributed resource allocation , 1997, AGENTS '97.

[13]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[14]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[15]  Anthony T. Chronopoulos,et al.  Algorithmic mechanism design for load balancing in distributed systems , 2002, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[16]  Ishfaq Ahmad,et al.  A pure Nash equilibrium guaranteeing game theoretical replica allocation method for reducing Web access time , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[17]  Shanshan Song,et al.  Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation , 2007, IEEE Transactions on Parallel and Distributed Systems.

[18]  Kavitha Ranganathan,et al.  Incentive mechanisms for large collaborative resource sharing , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[19]  Eitan Altman,et al.  On the Convergence to Nash Equilibrium in Problems of Distributed Computing , 2002, Ann. Oper. Res..

[20]  Albert Y. Zomaya,et al.  Intelligent Scheduling and Replication in Datagrids: a Synergistic Approach , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).