摘要: 针对基于服务覆盖网络的线性结构组合路由问题(LCRP),以负载均衡作为优化目标,将用户对组合服务的功能需求和服务质量需求作为约束条件建立优化模型,利用分层的思想和改进的蚂蚁算法AA_LCRP求解该模型。仿真实验结果证明,该模型的组合服务请求成功率较高,组合服务路径较短,AA_LCRP算法求解性能较好。
关键词:
服务组合,
组合服务路由,
线性结构组合路由问题,
分层模型,
蚂蚁算法
Abstract: Aiming at Liner-structured Composed Routing Problem(LCRP) based on Service Overlay Network(SON), this paper takes load balance as optimal goal and takes function and multi-QoS constraints of user requests as constraint conditions to construct optimal model. The layered method and improved ants algorithm named AA_LCRP are adopted to solve the problem. Simulation result proves that the success rate of service composition is higher and path length is shorter by using the model, and AA_LCRP has good performance.
Key words:
service composition,
composed service routing,
Linear-structured Composition Routing Problem(LCRP),
layered model,
ants algorithm
中图分类号:
张艳梅. 线性结构组合服务路由问题研究[J]. 计算机工程, 2011, 37(10): 64-66.
ZHANG Yan-Mei. Research on Linear-structured Composed Service Routing Problem[J]. Computer Engineering, 2011, 37(10): 64-66.