基于服务关联模型的服务排序算法——ServiceRank

Service Ranking Algorithm Based on Service's Relational Model—ServiceRank

提出一种以Web service关联结构为基础的权重计算和排序算法——ServiceRank。在ServiceRank中,每个Web service借助后继可组合关联关系,将自身的权重以连接度为尺度平均地分配给所有后继可组合Web service,并以类似的方法从所有前驱可组合Web service中获取权重。与现有方法相比,ServiceRank能提供全局一致的权重函数,且能离线工作,算法稳定性好且效率高。通过实验对算法的收敛性和稳定性进行了深入分析。

On the basis of Web service relational structure,this paper proposes an algorithm called ServiceRank to compute the service weight and rank the services In ServiceRank,by analyzing the relationship among the subsequent composable Web services,each Web service averagely distributes its weight by connectivity to all the subsequent composable Web services,and captures weight from all the predecessor composable Web services through the similar method.Compared with the current methods,ServiceRank has the ability to compute the unified weight function and to work offline.This paper thoroughly analyzes the convergence and stability of SercviceRank through experiments,which proves that the proposed algorithm has a high stability and efficiency.