摘要
为了提高匹配算法在大量服务请求时的执行效率,提出了一种支持服务Cache库的服务发现算法。将已匹配成功的服务放在专门的Cache库中,服务匹配时首先与Cache库中的服务进行匹配,匹配成功即可输出服务,否则再与注册库中的服务进行匹配,匹配成功后需及时更新Cache库中的服务以保持与注册库中的一致。为了筛选出符合要求的服务,提出在匹配过程中进行分阶匹配的策略,分不同阶段逐次进行匹配。实验结果表明,该方法可以有效地提高服务匹配的效率。
To improve the efficiency of the matching algorithm in a large number of services,a new matching algorithm supported cache library is proposed.Services that matched successfully are put into the cache library.When request service comes,it should first match with services in the cache library;if fails then match with services in the registering library.And it should update the cache library in time to maintain the consistency with the registering library.To get the services we need,the sub-order matching strategy is proposed,and the matching process is decomposed into several steps.The experimental result shows that the algorithm can apparently improve the matching efficiency.
出处
《计算机工程与设计》
CSCD
北大核心
2011年第3期940-944,共5页
Computer Engineering and Design
基金
国家863高技术研究发展计划基金项目(2006AA01Z128)
