基于时间依赖网络的组合服务快速选择算法

A Fast Algorithm of Services Selection Based on Time-Dependent Networks

针对在实时交互系统中海量信息服务的快速选择问题,提出一种基于时间依赖网络的组合服务快速选择算法。该算法所得到的组合路径是一个次优解,但其执行时间却比寻找最优解算法要少得多。实验结果表明,算法执行时间一般仅几秒钟,是一种适用于感知QoS动态变化的组合服务快速选择地有效算法。

A fast scheduling algorithm based on time-dependent network is presented solve the problem ot tast sclaedulmg from the massive information services. The combined path obtained by the algorithm is a suboptimal solution, but its execution time is much less than what is spent to find the optimal solution algorithm. The experimental results show that the algorithm execution time is generally in a few clocks, and this is an effective combined fast scheduling algorithm fit for perceiving QoS dynamic change.