Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2011, Vol. 37 ›› Issue (2): 248-250. doi: 10.3969/j.issn.1000-3428.2011.02.087

• Networks and Communications • Previous Articles     Next Articles

Research on Link Optimization Problem of Overlay Network

ZHANG Yan-mei   

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

覆盖网络的链路优化问题研究

张艳梅   

  1. (中央财经大学信息学院,北京 100081)
  • 作者简介:张艳梅(1976-),女,副教授、博士,主研方向:覆盖网络,服务计算,服务组合
  • 基金资助:
    中央财经大学“211工程”三期基金资助项目(2009211041)

Abstract: A multi-goal optimization model for Overlay Link Selection Problem(OLSP) is proposed based on the consideration of all factors influencing on Overlay network performance. It aims at achieving the best routing performance and the least IP link overlap degree with the least maintaining costs. Pareto optimality theory and Immune Clone Algorithm(ICA) are adopted to solve this problem and the digital simulation experimental result shows the availability of this model and the convergence of ICA .

Key words: Overlay Link Selection Problem(OLSP), Overlay network, link selection, topology optimization, multi-goal optimization, Immune Clone Algorithm(ICA)

摘要: 在综合考虑各个影响覆盖网络路由性能因素的基础上,提出针对覆盖链路选取问题(OLSP)的多目标优化模型,利用覆盖链路对物理链路的重用度因素使模型能以最少的维护代价获得最高的覆盖路由性能。采用Pareto占优理论和免疫克隆算法对OLSP进行求解,通过数字仿真实验验证该模型的合理性和ICA的有效性。

关键词: 覆盖链路选取问题, 覆盖网络, 链路选取, 拓扑优化, 多目标优化, 免疫克隆算法

CLC Number: