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
摘要: 最小预期时延(MED)是一种典型的延时可容忍网络(DTN)路由算法,其现有的改进算法MED-PC能有效地提升性能,但后者事实上加强了节点先验知识假设,缩小了应用范围,并引入过大的计算开销。该文针对以上问题,提出了一种新的改进算法——AMED。实验表明,AMED在维持前提假设不变的情况下,取得和MED-PC相当并明显优于MED的性能,而计算量和MED相当,明显小于MED-PC。
关键词:
延时可容忍网络,
路由算法,
最小预期时延,
AMED
CLC Number:
CHEN Piao; LU Han-cheng; LI Jin-sheng; HONG Pei-lin. Advanced Minimum Expected Delay Algorithm Used in DTN[J]. Computer Engineering, 2007, 33(21): 90-92,9.
陈 飘;卢汉成;李津生;洪佩琳. 用于延时可容忍网络的增强型MED路由算法[J]. 计算机工程, 2007, 33(21): 90-92,9.