Comparison of Service Selection Algorithms for Grid Services: Multiple Objective Particle Swarm Optimization and Constraint Satisfaction Based Service Selection

Grid computing has emerged as a global platform to support organizations for coordinated sharing of distributed data, applications, and processes. Furthermore, Grid computing has also leveraged Web services to define standard interfaces for grid services adopting the service-oriented view. Consequently, there have been significant efforts to enable applications capable of tackling computationally intensive problems as services on the Grid. In order to ensure that the available services are optimally assigned to the high volume of incoming requests, it is important to have an efficient service selection algorithm. The algorithm should not only increase access to the distributed services, promoting operational flexibility and collaboration, but should also allow service providers to scale efficiently to meet a variety of demands while adhering to certain current quality of service standards. This paper, proposes and compares two service selection algorithms on the Grid: the Multiple Objective Particle Swarm Optimization algorithm using Crowding Distance technique (MOPSO-CD) to the Constraint Satisfaction based Matchmaking (CS-MM) algorithm.

[1]  Prospero C. Naval,et al.  An effective use of crowding distance in multiobjective particle swarm optimization , 2005, GECCO '05.

[2]  Jerry R. Hobbs,et al.  DAML-S: Web Service Description for the Semantic Web , 2002, SEMWEB.

[3]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[5]  Rajkumar Buyya,et al.  High Performance Cluster Computing: Architectures and Systems , 1999 .

[6]  Russell C. Eberhart,et al.  Multiobjective optimization using dynamic neighborhood particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[7]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Simone A. Ludwig,et al.  Introduction of semantic matchmaking to Grid computing , 2005, J. Parallel Distributed Comput..

[9]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[10]  Ian T. Foster,et al.  Grid Services for Distributed System Integration , 2002, Computer.

[11]  Mitsuhisa Sato,et al.  Design and implementations of Ninf: towards a global computing infrastructure , 1999, Future Gener. Comput. Syst..

[12]  Chuang Liu,et al.  Design and evaluation of a resource selection framework for Grid applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[14]  Hui Lei,et al.  Monitoring the QoS for Web Services , 2007, ICSOC.

[15]  Rajkumar Buyya,et al.  A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids , 2002, ArXiv.

[16]  M. N. Vrahatis,et al.  Particle swarm optimization method in multiobjective problems , 2002, SAC '02.

[17]  Simone A. Ludwig,et al.  Position Paper: A Grid Service Discovery Matchmaker Based on Ontology Description , 2002, EuroWeb.

[18]  Domenico Talia.  The Open Grid Services Architecture: Where the Grid Meets the Web , 2002, IEEE Internet Comput..

[19]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[20]  Sanjiva Weerawarana,et al.  Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDI , 2002, IEEE Internet Computing.

[21]  Simone Anja Ludwig.  A semantic approach to service discovery in a grid environment , 2004, J. Web Semant..

[22]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[23]  Sanjay Jha,et al.  G-QoSM: Grid Service Discovery Using QoS Properties , 2002, Comput. Artif. Intell..

[24]  Simone A. Ludwig,et al.  Selection Algorithm for Grid Services based on a Quality of Service Metric , 2007, 21st International Symposium on High Performance Computing Systems and Applications (HPCS'07).

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

[26]  emontmej,et al.  High Performance Computing , 2003, Lecture Notes in Computer Science.

[27]  Jon B. Weissman,et al.  Adaptive resource selection for grid-enabled network services , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..