期刊名称：International Journal of Electronics and Computer Science Engineering
电子版ISSN：2277-1956
出版年度：2012
卷号：1
期号：3
页码：845-852
出版社：Buldanshahr : IJECSE
摘要：We 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. We propose a framework for evaluating routing algorithms in such environments. We then develop two algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that with additional knowledge, far less than complete global knowledge; efficient algorithms can be constructed for routing in such environments
