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

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.