算法UPSC | User preferences service composition algorithm |
输入 | G(V,E), S, |
输出 | 最短路径集ShortestRoute; |
初始化变量 | 1: |
根据用户在第k个周期内累计访问服务组合S的时长 | 2: for i = 1 to S do 3: Sum = 0 4: for I = 1 to m do 5: if 6: Sum+=k* 7: end if 8: end for |
计算加权平均访问时长 | 9:根据定义4.6计算用户在最近m个周期内对服务组合S的加权平均访问时长 |
在两个服务组件为同一服务组合中的元素时的次数 | 10: for x = 1 to p do 11: for y = 1 to p do 12: if y! = x then 13: if t (ax,ay) > 0 and ax,ay Î Si then 14: 15: end if 16: end if 17: end for 18: end for |
计算亲近度 | 20: for x = 1 to p do 21: for y = 1 to p do 22: if y! = x then 23: 24: if 25: 26: else 27: 28: end if 29: end for 30: end for |
利用Dijkstra算法,选取路径,得到从服务入口经其他组件到达服务出口的最短路径 | 31:利用Dijkstra算法求出最短路径集Shortest Route 32:return Shortest Route |