登录 | 注册 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
面向时延优化的Overlay路由策略研究
  • 摘要

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

  • 作者

    叶枰  李益忠  夏勤  YE Ping  LI Yi-Zhong  XIA Qin 

  • 作者单位

    东南大学计算机网络和信息集成教育部重点实验室,南京,210096;东南大学计算机科学与工程学院,南京,210096

  • 刊期

    2010年1期 ISTIC EI PKU

  • 关键词

    时延优化  单跳路径路由  Overlay路由  蚁群算法  邻居节点集合  delay optimization  one-hop path routing  Overlay routing  ant colony optimization  neighborhood set 

参考文献
  • [1] Akihiro Nakao;Larry Peterson;Andy Bavier. Scalable Routing Overlay Networks. Operating systems review, 2006,1
  • [2] Engebretsen L;Karpinski M. TSP with bounded metrics. Journal of Computer and System Sciences, 2006,4
  • [3] Daniel Merkle;Martin Middendorf. Modeling the Dynamics of Ant colony Optimization. Evolutionary computation, 2002,3
  • [4] Savage S.;Anderson T.. Detour: informed Internet routing and transport. IEEE Micro, 1999,1
  • [5] Loguinov D.;Casas J.;Xiaoming Wang. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. IEEE/ACM Transactions on Networking: A Joint Publication of the IEEE Communications Soceity, the IEEE Computer Society, and the ACM with Its Special Interest Group on Data Communication, 2005,5
  • [6] Lua Keong;Croweroft Jon;Pias Marelo. A survey and comparison of peer-to-peer Overlay network schemes. IEEE Communication Surveys & Tutorials, 2005,02
  • [7] Zhao Ben Y;Kubiatowicz John;Joseph Anthony D. Tapestry;An infrastructure for fault-tolerant wide-area location and routing. University of California Berkeley:Technical Report:CSD-01-1141, 2001
  • [8] Gummadi Krishna P;Madhyastha Harsha V;Gribble Steven D. Improving the reliability of internet paths with one-hop source routing. San Francisco,CA,USA, 2004
  • [9] Lessing Lucas;Dumitrescu Irina;Stutzle Thomas. A comparison between ACO algorithms for the set covering prob-lem. 2004
  • [10] Cornell University. Meridian data. http://www.cs.cornell.edu/People/egs/meridian, 2004
  • [11] Chun B;Fonseca R;Stoica I. Characterizing selfishly constructed Overlay routing networks. Hong Kong,China, 2004
  • [12] Gummadi K;Gmmadi R;Gribble S. The impact of DHT routing geometry on resilience and proximity. Karlsruhe,Germany, 2003
  • [13] Christin N;Chuang J. A cost-based analysis of Overlay routing geometries. Miami,USA, 2005
  • [14] Zhu Yong. Dovrolis Constaintinos,Ammar Mostafa.Dynamic Overlay routing based on available bandwidth estimation:A simulation study.Computer Networks!. The International Journal of Computer and Telecommunications Networking, 2006,06
  • [15] Akella Aditya;Pang Jeffrey;Maggs Bruce. A comparison of Overlay routing and multihoming route control. ACM SIGCOMM Computer Communication Review, 2004,04
  • [16] Vleeschauwer B D;Turck F D;Dhoedt;B. On the construction of QoS enabled Overlay networks. Barcelona,Catalonia,Spain, 2004
  • [17] Zhang H;Tang L;Li J. Impact of Overlay routing on end-to-end delay. Boston,Massachusetts,USA, 2006
查看更多︾
相似文献 查看更多>>
34.226.244.70