首页 | 官方网站   微博 | 高级检索  
     

多目标的Internet路由优化控制算法
引用本文:刘红,白栋,丁炜,曾志民.多目标的Internet路由优化控制算法[J].电子学报,2004,32(2):306-309.
作者姓名:刘红  白栋  丁炜  曾志民
作者单位:1. 北京邮电大学宽带通信网络实验室,北京 100876;2. 北京大学卫星通信实验室,北京 100871
基金项目:高等学校博士学科点专项科研项目,国家自然科学基金
摘    要:研究通过优化链路权值以控制网络路由来实施流量工程.以网络拥塞最小化和时延最小化为流量工程目标,建立了多目标的全局路由优化数学模型.求解该问题是NP困难的,提出一种混沌群搜索优化算法进行求解.算法采用群局部搜索,利用混沌变量产生一组分布好的初始解,并在邻域搜索进程中应用扩展贪心思想,提高了算法的全局搜索能力.仿真结果表明所提算法能够有效减少由于流量分布不平衡造成的网络拥塞,同时限制长路径,提高了网络性能.

关 键 词:流量工程  路由  拥塞  时延  局部搜索  
文章编号:0372-2112(2004)02-0306-04
收稿时间:2003-01-10

Internet Routing Optimization Control Algorithm with Multiple Objectives
LIU Hong ,BAI Dong ,DING Wei ,ZENG Zhi min.Internet Routing Optimization Control Algorithm with Multiple Objectives[J].Acta Electronica Sinica,2004,32(2):306-309.
Authors:LIU Hong  BAI Dong  DING Wei  ZENG Zhi min
Affiliation:1. Broadband Communication Network Lab,Beijing University of Posts and Telecomm,Beijing 100876,China;2. Satellite Communication Lab,Peking University,Beijing 100871,China
Abstract:Internet routing control by link weights optimization with traffic engineering objectives is studied.It is modeled as a mathematical programming problem with the objectives of network congestion minimization and delay minimization.It is a NP hard problem,and a chaotic group search algorithm based on local search is proposed,which makes use of chaos variable to find initial solutions with favorable distribution,and applies extended greedy principle to local search process to increase global search ability.Simulation results manifest that it improves network performance with decreased congestion probability caused by unbalanced traffic distribution,and restricted extra path hops.
Keywords:traffic engineering  routing  congestion  delay  local search
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号