计算机工程 ›› 2007, Vol. 33 ›› Issue (21): 90-92,9.doi: 10.3969/j.issn.1000-3428.2007.21.032

• 网络与通信 • 上一篇    下一篇

用于延时可容忍网络的增强型MED路由算法

陈 飘,卢汉成,李津生,洪佩琳   

  1. (中国科学技术大学电子工程与信息科学系,合肥 230027)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-05 发布日期:2007-11-05

Advanced Minimum Expected Delay Algorithm Used in DTN

CHEN Piao, LU Han-cheng, LI Jin-sheng, HONG Pei-lin   

  1. (Dept. of Electronic Engineering & Information Science, University of Science and Technology of China, Hefei 230027)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-05 Published:2007-11-05

摘要: 最小预期时延(MED)是一种典型的延时可容忍网络(DTN)路由算法,其现有的改进算法MED-PC能有效地提升性能,但后者事实上加强了节点先验知识假设,缩小了应用范围,并引入过大的计算开销。该文针对以上问题,提出了一种新的改进算法——AMED。实验表明,AMED在维持前提假设不变的情况下,取得和MED-PC相当并明显优于MED的性能,而计算量和MED相当,明显小于MED-PC。

关键词: 延时可容忍网络, 路由算法, 最小预期时延, AMED

Abstract: MED is one of DTN’s routing algorithms and MED-PC is a variant in existence, which improves the performance in MED, but requires more preconditions and computing resources. This paper presents a new algorithm called AMED, which avoids the problem of MED-PC as well as keeps its performance.

Key words: delay tolerant network (DTN), routing algorithm, minimum expected delay (MED), AMED

中图分类号: