一种区分服务的DTN概率路由算法

针对DTN网络中不同优先级的数据包需要区分服务的问题, 提出了区分服务的概率路由算法SDRP。该算法提出了参考概率这一概念, 相遇节点针对不同的数据包优先级定义了不同的参考概率, 若相遇节点的参考概率大于发送节点的转发概率则将数据包转发, 否则不转发。仿真表明, SDRP算法使不同优先级数据包的递交率呈层次化分布, 高中低优先级数据包的递交率由高到低依次排列。该算法使DTN网络在不改变原有网络通信性能的基础上, 较好地实现了根据数据包优先级的不同而区分服务的功能。

Service distinguished DTN probabilistic routing algorithm

In allusion to service differently according to the different packets priority for the DTN network, this paper put forward the SDRP algorithm. The algorithm presented the concept of the reference probability, which was defined differently according to the packets priority of meeting hybrids. If the reference probability of meeting hybrid was greater than that of sending node, the packet would be transmitted. Simulation results show that the SDRP algorithm distinguishes different priority packets through hierarchical distributed delivery ratio. The algorithm achieves the function of distinguishing services in DTN network without changing the original network communication performance.