On the Simulation of Grid Market Coordination Approaches

Grid computing has recently become an important paradigm for managing computationally demanding applications, composed of a collection of services. The dynamic discovery of services, and the selection of a particular service instance providing the best value out of the discovered alternatives, poses a complex multi-attribute n:m allocation decision problem, which is often solved using a central resource broker. However, decentralized approaches to this service allocation problem represent a much more flexible alternative, thus promising improvements in the efficiency of the resulting negotiations and service allocations. This paper compares centralized and decentralized service allocation mechanisms in Grid market scenarios according to a defined set of metrics.

[1]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[2]  Björn Schnizler.  MACE: A Multi-attribute Combinatorial Exchange , 2006, Negotiation, Auctions, and Market Engineering.

[3]  Wolfram Conen,et al.  Economically Coordinated Job Shop Scheduling and Decision Point Bidding - An Example for Economic Coordination in Manufacturing and Logistics , 2002, PuK.

[4]  Rajkumar Buyya,et al.  Enabling the Simulation of Service-Oriented Computing and Provisioning Policies for Autonomic Utility Grids , 2007, GECON.

[5]  V. Smith.  An Experimental Study of Competitive Market Behavior , 1962, Journal of Political Economy.

[6]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[7]  Henri Casanova,et al.  Scheduling distributed applications: the SimGrid simulation framework , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[8]  J. Kagel,et al.  Handbook of Experimental Economics , 1997 .

[9]  Satoshi Fujita,et al.  On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[10]  Nick Taylor,et al.  A Framework for Evolutionary Computation in Agent-Based Systems , 1999 .

[11]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[12]  Floriano Zini,et al.  Analysis of Scheduling and Replica Optimisation Strategies for Data Grids Using OptorSim , 2004, Journal of Grid Computing.

[13]  Y. Narahari,et al.  AN ITERATIVE AUCTION MECHANISM FOR COMBINATORIAL LOGISTICS EXCHANGES , 2004 .

[14]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[15]  P. Cramton,et al.  Introduction to Combinatorial Auctions , 2006 .

[16]  Satoshi Fujita,et al.  On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions , 2004, J. Heuristics.

[17]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[18]  Torsten Eymann,et al.  Decentralized vs. Centralized Economic Coordination of Resource Allocation in Grids , 2003, European Across Grids Conference.

[19]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[20]  Jerry R. Green,et al.  Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods , 1977 .

[21]  I. Foster,et al.  Service-Oriented Science , 2005, Science.

[22]  Mark A. Satterthwaite,et al.  The Bayesian theory of the k-double auction: Santa Fe Institute Studies in the Sciences of Complexity , 2018 .

[23]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[24]  Peter G. Klein,et al.  The collected works of F , 1989 .

[25]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[26]  Jeffrey S. Rosenschein,et al.  Rules of Encounter - Designing Conventions for Automated Negotiation among Computers , 1994 .

[27]  Torsten Eymann,et al.  Hayek's Catallaxy: A Forward-Looking Concept for Information Systems? , 2003, AMCIS.

[28]  Peter G. Klein,et al.  The collected works of F. A. Hayek , 1989 .

[29]  L. Tesfatsion.  HOW ECONOMISTS CAN GET ALIFE , 1995 .

[30]  Francine Berman,et al.  Grid Computing: Making the Global Infrastructure a Reality , 2003 .

[31]  Torsten Eymann,et al.  Evaluation of Economic Resource Allocation in Application Layer Networks - A Metrics Framework , 2007, Wirtschaftsinformatik.

[32]  Noam Nisan,et al.  The POPCORN market. Online markets for computational resources , 2000, Decis. Support Syst..

[33]  Rajkumar Buyya,et al.  GridSim: A Toolkit for the Modeling and Simulation of Global Grids , 2001 .

[34]  Muthucumaru Maheswaran,et al.  Towards a micro-economic model for resource allocation in Grid computing systems , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

[35]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[36]  Asit Dan,et al.  Cremona: an architecture and library for creation and monitoring of WS-agreents , 2004, ICSOC '04.

[37]  Andrew A. Chien,et al.  The MicroGrid: a Scientific Tool for Modeling Computational Grids , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[38]  Dirk Neumann,et al.  Trading grid services - a multi-attribute combinatorial approach , 2008, Eur. J. Oper. Res..

[39]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[40]  D. MacKenzie,et al.  The use of knowledge about society , 2008 .

[41]  Björn Schnizler.  Resource allocation in the Grid: a market engineering approach , 2007 .

[42]  Kurt Stockinger,et al.  OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies , 2003 .

[43]  J. Plank,et al.  Grid Resource Allocation and Control Using Computational Economies , 2003 .

[44]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[45]  David C. Parkes,et al.  Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges , 2001, IJCAI.