作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (10): 64-66. doi: 10.3969/j.issn.1000-3428.2011.10.021

• 网络与通信 • 上一篇    下一篇

线性结构组合服务路由问题研究

张艳梅   

  1. (中央财经大学信息学院,北京 100081)
  • 出版日期:2011-05-20 发布日期:2011-05-20
  • 作者简介:张艳梅(1976-),女,副教授、博士,主研方向:智能优化算法,覆盖网络,面向服务的计算
  • 基金资助:
    教育部科学技术研究基金资助重点项目(109016);中央财经大学“211工程”三期基金资助项目(2009211041)

Research on Linear-structured Composed Service Routing Problem

ZHANG Yan-mei   

  1. (School of Information, Central University of Finance and Economics, Beijing 100081, China)
  • Online:2011-05-20 Published:2011-05-20

摘要: 针对基于服务覆盖网络的线性结构组合路由问题(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

中图分类号: