摘要
研究通过优化链路权值以控制网络路由来实施流量工程 .以网络拥塞最小化和时延最小化为流量工程目标 ,建立了多目标的全局路由优化数学模型 .求解该问题是NP困难的 ,提出一种混沌群搜索优化算法进行求解 .算法采用群局部搜索 ,利用混沌变量产生一组分布好的初始解 ,并在邻域搜索进程中应用扩展贪心思想 ,提高了算法的全局搜索能力 .仿真结果表明所提算法能够有效减少由于流量分布不平衡造成的网络拥塞 ,同时限制长路径 ,提高了网络性能 .
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.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2004年第2期306-309,共4页
Acta Electronica Sinica
基金
教育部博士学科点基金 (No.2 0 0 2 0 0 1 30 1 1 )
国家自然科学基金 (No .6980 2 0 0 3)
关键词
流量工程
路由
拥塞
时延
局部搜索
Algorithms
Chaos theory
Computational complexity
Computer simulation
Congestion control (communication)
Mathematical models
Optimization
Routers
Telecommunication traffic
