By Topic

Optimization of service selection algorithm for complex event processing in Enterprise Service Bus platform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kun Ding ; Nanjing Telecommun. Technol. Inst., Nanjing, China ; Bo Deng ; Xiaoyi Zhang ; Li Ge

How to find and select services in enterprise applications when building enterprise service bus (ESB) platform has become a hot research topic. The existing QoS-based services selection and binding approaches always pay attention to the quality of successful service execution, and lose sight of the possibility that the services execution would be failed. Unfortunately, in many loose-couple environments, the services can't guarantee the executing will success. For this case, this paper proposes an optimized service selection algorithm for complex event processing, named greedy service selection (GSS) algorithm. This algorithm is to choose and execute a service instance which has the greatest ldquobenefit/costrdquo ratio in all service instances, taking into account the services failed possibility. Experiments results show that this algorithm is efficient for service selection in enterprise service bus platform.

Published in:

Computer Science & Education, 2009. ICCSE '09. 4th International Conference on

Date of Conference:

25-28 July 2009