CAJ | 학술논문

路由扩展性是Overlay网络的研究热点,其中网络时延作为Overlay路由性能的一个关键指标已成为重点研究内容之一.文中对Overlay路由及其扩展性问题进行描述,并在此基础上进行数学建模和分析.针对时延优化目标,提出一种基于蚁群算法的单跳路由路径策略来处理邻居节点集合维护的问题:通过蚂蚁爬行的过程建屯邻居节点集合,并根据设定的质量评估函数进行修剪来控制每个节点上维护的邻居节点集合大小.通过仿真实验对Overlay路由性能进行的分析,证实了Overlay路由在时延优化方面的可行性,同时实验结果表明了ACOHPR在对平均时延影响很小的情况下能够有效地降低每个节点的邻居节点集合大小.
로유확전성시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.