Routing in a delay tolerant network
Routing in a delay tolerant network
复制标题
DOI：
10.1145/1015467.1015484
复制
发表时间：
2004-08
期刊：
影响因子：
--
通讯作者：
S. Jain;K. Fall;Rabin K. Patra
中科院分区：
文献类型：
--
作者：
S. Jain;K. Fall;Rabin K. Patra
我们提出了延迟容忍网络路由问题，其中消息要在一个连通图上端到端地移动，该连通图是时变的，但其动态可能预先知道。该问题增加了每个节点的有限缓冲区的约束，以及可能永远不存在同时的端到端路径的一般性质。这种情况限制了传统路由方法的适用性，这些方法倾向于将中断视为故障并寻求找到现有的端到端路径。我们提出了一个在这样的环境下评估路由算法的框架。然后，我们开发了几个算法，并使用模拟来比较它们的性能与它们所需的网络拓扑知识的数量。我们发现，正如预期的那样，使用最少知识的算法往往执行得很差。我们还发现，在有限的附加知识，远远少于完整的全局知识的情况下，可以构造出有效的算法来在这样的环境中进行布线。据我们所知，这是第一次对DTN中路由问题进行这样的调查。
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.