一种DTN网络摆渡节点存储分配方案研究

Research on a Storage Allocation Schema for DTN Ferry Node

为提高DTN网络性能,针对摆渡路由算法中摆渡节点存储资源分配存在的公平性问题,提出了一种基于加权最大最小公平原则的摆渡节点存储资源的优化分配方案。区别于现有摆渡节点存储资源分配所使用的先来先服务方式,加权最大最小公平原则可以在保证数据节点在获得公平的数据传输机会的同时,为重点任务提供更多的资源支持。仿真实验表明,经过存储资源优化的摆渡路由算法与现有摆渡路由算法相比较,在网路传输成功率、平均网络时延等方面性能均有显著提高。

In order to improve the performance of DTN network and address the problem of fairness in the allocation of storage resources of ferry nodes in ferry routing algorithm. We propose an optimal allocation scheme based on the weighted max min fairness.Different from the existing ferry node storage resources allocation by using the first come first service,the weighted max min fairness principle can provide more resource support for the key tasks while ensuring the fair data transmission opportunities. The simulation results show that the performance of the proposed algorithm is better than that of the existing ferry routing algorithm,the network transmission success rate and average network delay and other aspects of performance have been significantly improved.