International Journal of Electronics and Computer Science Engineering
The authors try to 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. They propose a framework for evaluating routing algorithms in such environments. They then develop two algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology.