A New Service Matching Algorithm for Business End Programming
Yanbo Han · Jisuanji gongcheng · 2006
Dynamic binding and substitution of services is the key to keep the applications run smoothly.On the basis of the requirements of service matching for business end programming and the analyses of several prevailing algorithms,this paper presents a new service matching approach to support dynamic and agile application execution.It is proved that the algorithms meets the frequently changed business requirements. This approach is used in a project which aims to mediate individual services for the general public in the Olympic Games 2008.