Optimization of Service Selection Algorithm for Complez 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 cant 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 benefit/cost 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.
Enterprise Service Bus Complez Event Processing Service Selection
DING Kun DENG Bo ZHANG Xiaoyi Li Ge
Nanjing Telecommunication Technology Institute Nanjing, China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
582-586
2009-07-25（万方平台首次上网日期，不代表论文的发表时间）