面向时延优化的Overlay路由策略研究  

Delay Optimization Based Overlay Routing Strategy

作　　者：叶枰[1,2] 李益忠[1,2] 夏勤[1,2] 

机构地区：[1]东南大学计算机网络和信息集成教育部重点实验室,南京210096 [2]东南大学计算机科学与工程学院,南京210096

出　　处：《计算机学报》2010年第1期36-44,共9页Chinese Journal of Computers

基　　金：国家自然科学基金重大研究计划项目(90604003);国家自然科学基金项目(60603067)资助~~

摘　　要：路由扩展性是Overlay网络的研究热点,其中网络时延作为Overlay路由性能的一个关键指标已成为重点研究内容之一.文中对Overlay路由及其扩展性问题进行描述,并在此基础上进行数学建模和分析.针对时延优化目标,提出一种基于蚁群算法的单跳路由路径策略来处理邻居节点集合维护的问题:通过蚂蚁爬行的过程建立邻居节点集合,并根据设定的质量评估函数进行修剪来控制每个节点上维护的邻居节点集合大小.通过仿真实验对Overlay路由性能进行的分析,证实了Overlay路由在时延优化方面的可行性,同时实验结果表明了ACOHPR在对平均时延影响很小的情况下能够有效地降低每个节点的邻居节点集合大小.The routing scalability of Overlay network has become a research focus.The network delay is one important branch of the scalability field as a key parameter.This paper gives a description of Overlay routing and its scalability problem,on the basis of which the mathematical modeling are established.An improved one-hop path routing algorithm based on ant colony optimization（ACOHPR）is employed to solve the problem of maintaining neighborhood set in allusion to delay optimization.The neighborhood set is formed in the progress of ant crawl, which is pruned according to the quality evaluating function in order to control the size of neighborhood set in every node. By simulation the performance of Overlay routing is analyzed and its feasibility in delay optimization is validated. The simulation results also show that ACOHPR can effectively reduce the size of neighborhood set with little influence in average delay.

关 键 词：时延优化 单跳路径路由 Overlay路由 蚁群算法 邻居节点集合 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]