覆盖网随机路由方法  

Random Overlay Routing

作　　者：华婷[1] 江勇[1] 徐恪[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《小型微型计算机系统》2013年第5期951-958,共8页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61170292;60970104)资助;国家"九七三"重点基础研究发展计划项目(2009CB320501)资助;国家"八六三"高技术研究发展计划项目(2008AA01A323;2008AA01A326)资助

摘　　要：覆盖网允许节点自行选择路由,但由于路由计算方法的自私性以及信息的延迟,往往会导致网络性能的恶化.提出一种随机路由方法,来缓解节点之间的路由冲突.首先,研究了候选路由的数目对于随机方法性能的影响,发现选取两条路径作为候选路由,能使随机方法达到较好的性能,同时不会引入过多开销.而后,为了比较随机路由和传统自私路由方法的性能,在多种网络条件下进行了实验模拟,结果表明:拓扑连接度对两种路由方法的性能表现有至关重要的作用,而流量负载水平影响较小.在拓扑连接度较高的情况下,随机方法能获得较好的性能.Overlay networks allow node source routing. But due to selfish routing and out-dated information, source routing sometimes results in bad performance. We propose a routing scheme based on randomization to avoid the routing conflicts. It is interesting to find that, in random routing method, choosing two route candidates will gain comparatively better performance without bringing too much cost. By testing random routing and traditional selfish scheme under different network conditions, we find that traffic load has little impact on the comparison of these two methods, which method is better mainly depends on the topology they are running on. Selfish method is indeed more efficient in topologies with low connectivity, but as the connection degree increases, random routing scheme can obtain dramatic improvement over selfish routing.

关 键 词：覆盖网 源路由 随机方法 自私路由 

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