面向時延优化的Overlay路由策略研究.docVIP

面向时延优化的Overlay路由策略研究 叶枰1,2 李益忠1,2 夏勤1,2 1（东南大学 计算机网络和信息集成教育部重点实验室 南京 210096） 2（东南大学 计算机科学与工程学院 南京 210096） 摘要：路由扩展性是Overlay网络的研究热点，其中网络时延作为Overlay路由性能的一个关键指标已成为重点研究内容之一。本文对Overlay路由及其扩展性问题进行了描述，并在此基础上进行数学建模和分析。针对时延优化目标，提出一种基于蚁群算法的单跳路由路径策略来处理邻居节点集合维护的问题，通过蚂蚁爬行的过程建立邻居节点集合，并根据设定的质量评估函数进行修剪来控制每个节点上维护的邻居节点集合大小。仿真实验对Overlay路由性能进行了分析，证实了Overlay路由在时延优化方面的可行性，同时实验结果表明了ACOHPR在对平均时延影响很小的情况下能够有效地降低每个节点的邻居节点集合大小。 关键词：时延优化，单跳路径路由，Overlay路由，蚁群算法，邻居节点集合 中图分类号：TP393.02+ Delay Optimization Based Overlay Routing Strategy YE Ping, LI Yi-zhong and XIA Qin (Key Laboratory of Computer Network and Information Integration, Southeast University, Nanjing 210096 , China) (School of Computer Science and Engineering, Southeast University, Nanjing 210096, China) Abstract: 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. The simulation first analyzes the performance of Overlay routing and validates its feasibility in delay optimization. The simulation results also show that ACOHPR can effectively reduce the size of neighborhood set with little influence in average delay. Keyword: delay optimization, one-hop path routing, overlay routing, ant colony optimization, neighborhood set 引言 Overlay思想在计算机网络发展过程中起到了极为重要的作用，从通信协议的分层设计到互联网在各种异构网络上的部署，这种“下层为上层提供服务，上层使用下层服务”的思想有效地降低了网络设计、部署的复杂性，为互联网上各种应用的顺利展开提供了有力的保障。近年来网络研究人员进一步拓展了Overlay的概念，通过在现有网络的应用层构建Overlay网络来实现新应用，满足用户的新需求。这些系统的快速