Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
An approach for selecting best available services through a new method of decomposing QoS constraints
Surianarayanan C., Ganapathy G., Ramasamy M. Service Oriented Computing and Applications9 (2):107-138,2015.Type:Article
Date Reviewed: Nov 13 2015

A practical and theoretical problem that is very important in service-centric information technology (IT) environments is addressed in this paper: a strategy that can be formalized algorithmically to find at least suboptimal configurations of potential services that comply with a set of prescribed quality of service (QoS) constraints. As the paper pinpoints, the resolution of the problem leads to a combinatorial explosion, even though the most modern algorithmic approaches that originated from artificial and computational intelligence are used.

The paper proposes a strategy and a related algorithmic method that basically conform to the conquer-and-rule approach; that is, the formulated problem should be partitioned into subproblems that are under some restrictions deduced from the original requirements (QoS constraints).

Service-oriented architecture (SOA), more generally service-centric environments, originally promised flexible opportunities for configuring services (orchestration, choreography) for a purpose. These services are offered by various service providers, and at the same time the providers yield information on service levels.

The original business requirement can be defined in the form of a workflow that consists of business processes that are comprised of tasks. The problem is finding a collection of services that carries out the specified tasks and satisfies the prescribed QoS constraints. The paper proposes an algorithm and a method that can solve this problem in a reasonable computation time so that the proposed method is applicable for dynamic service composition. The paper describes in detail the proposed method, including the mathematical equations that are used for estimation. Furthermore, the paper also presents pseudocode for the proposed algorithm.

Experiments and a comparative study prove the feasibility of the proposed approach. Two methods in the literature cover the same subject domain. An experimental comparative study analyzes the fitness of the methods; several essential parameters of the two previous approaches and the proposed method are investigated, and the advantages of the proposed one are demonstrated.

The paper is worth reading for researchers and practitioners who are involved in the service-centric world and are searching for useful algorithms for dynamic service composition within time constraints.

Reviewer:  Bálint Molnár Review #: CR143950 (1601-0080)
Bookmark and Share
  Featured Reviewer  
 
Web-Based Services (H.3.5 ... )
 
 
Service-oriented architecture (SOA) (D.2.11 ... )
 
 
Performance of Systems (C.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Web-Based Services": Date
Bibliometric analysis of the impact of Internet use on scholarly productivity
Kaminer N., Braunstein Y. Journal of the American Society for Information Science 49(9): 720-730, 1998. Type: Article
Nov 1 1998
Intermediaries personalize information streams
Maglio P., Barrett R. Communications of the ACM 43(8): 96-101, 2000. Type: Article
Oct 1 2000
Searching the Web
Arasu A., Cho J., Garcia-Molina H., Paepcke A., Raghavan S. ACM Transactions on Internet Technology 1(1): 2-43, 2001. Type: Article
Feb 1 2002
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy