摘要
为避免集中式Web服务发布和检索机制的单点故障问题,设计了一种面向对等网络的Web服务快速查找算法.对等网络中内容相同的Web服务构成服务联盟.服务之间用同盟列表建立联系,使得服务请求能够在联盟内部得到快速传播,提高了服务查找的效率.在PeerSim平台上的仿真实验结果表明,该算法能以很快的查找速度找到目标,并搜寻较大的覆盖范围.
In order to avoid the single-point-failure problem in centralized Web service publishing and finding mechanisms, a fast searching algorithm based on P2P networks was proposed in this paper. Service Alliance composed Web services with same content. Service requests could be spread rapidly through out the alliance by means of the alliance information. This improved the efficiency of services to be found. The experimental results in PeerSim platform showed that the algorithm could find targets more lastly and roam over a greater scope.
出处
《微电子学与计算机》
CSCD
北大核心
2009年第8期59-61,共3页
Microelectronics & Computer
基金
河北省自然科学基金项目(F2009000929)
河北省教育厅自然科学指令性计划项目
