一个基于QoS的服务路径发现和恢复算法

An Algorithm of Finding and Recovering a QoS-Aware Service Path

用一种新的方法研究服务组合问题,提出一个服务干扰模型来定量地刻画用户对组合服务的满意度.定义服务干扰强度是在服务路径恢复中单位时间内节点的替代数目.为降低服务路由的计算量,设计了有效的路由算法,提出3个简化路由选择策略:惰性调整策略、选择可靠节点策略和本地恢复策略,并基于这3个策略和干扰模型给出优化的最小干扰服务路由算法.研究表明,在发现服务路径时,提出的模型和算法降低了对端用户的干扰,提高了系统的健壮性和稳定性.

A new approach is presented to studying QoS-aware service combination. An interference model is proposed to quantitatively characterize and measure how the interference affects the service provided for users. The interference intensity is defined as the substituted number of nodes per unit time when recovering a service path. To reduce the service routing computation, an efficient routing algorithm is designed, with three optional strategies for simplified routings provided, i.e., lazy adjustment, selecting reliable nodes and local path recovery. Then, based on the three strategies and the interference model proposed, an optimized minimum interference service routing algorithm is given. The results showed that both the algorithm and model proposed can reduce the interference on end users and improve the system robustness and stability when finding service paths.