DTN中概率选择的散发等待路由

目前的Internet体系结构和许多协议无法很好地适应延迟较高和间歇性链接的网络,这些网络有它们自己的专有协议,即聚束层协议,而不采用TCP/IP协议。为了实现这样的网络之间的互联,国际上提出了一种在端到端链接和节点资源都受限的新型网络体系和应用接口,即容迟网络（DTN）。文中主要讨论DTN网络的路由算法,在DTN路由算法中,蔓延路由和概率路由能提供较高的报文投递率,较小的投递延迟,但是开销很大。散发等待路由虽然具有较小的开销,但是投递率低、延迟较大,提出了投递效用的概念。在融合概率选择路由和散发等待路由的基础上,提出了具有概率选择的散发等待路由。通过仿真,与其它已有算法相比,显著提高了报文投递效用。

Spay and Wait Routing with Probabilistic Choice in DTN

The successful architecture and supporting protocols for today＇s Internet operate poorly in the operating environments characterized by very long delay paths and frequent network partitions.These network architectures have their own special protocols,that is,the Bundle protocols.To achieve interoperability between these networks,a new network architecture and application interface——DTN,which is restrained at both end-to-end links and node resources.In the DTN routing algorithms,the epidemic routing and probabilistic routing could provide higher delivery probability and shorter delays,but is with a large overhead,while the spay and wait routing could reduce the overhead,but is with low delivery probability and high delay.This paper proposes the concept of delivery utility.And based on combination of spay and wait routing and probabilistic routing,the spay and wait routing with probabilistic choice is suggested.The simulation results indicate that this method could achieve even higher delivery probability efficiency.