Routing in a delay tolerant network Export

@article{citeulike:712817, abstract = {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.}, address = {New York, NY, USA}, author = {Jain, Sushant and Fall, Kevin and Patra, Rabin}, citeulike-article-id = {712817}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1030194.1015484}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1030194.1015484}, doi = {10.1145/1030194.1015484}, isbn = {1581138628}, issn = {0146-4833}, journal = {SIGCOMM Comput. Commun. Rev.}, keywords = {deterministic, disconnected-networks, modified-shortest-path, sota}, month = {October}, number = {4}, pages = {145--158}, posted-at = {2006-06-27 18:53:04}, priority = {2}, publisher = {ACM}, title = {Routing in a delay tolerant network}, url = {http://dx.doi.org/10.1145/1030194.1015484}, volume = {34}, year = {2004} }

TY - JOUR ID - citeulike:712817 L3 - citeulike-article-id:712817 N2 - 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. IS - 4 JF - SIGCOMM Comput. Commun. Rev. SN - 1581138628 AD - New York, NY, USA EP - 158 TI - Routing in a delay tolerant network PB - ACM VL - 34 SP - 145 KW - deterministic KW - disconnected-networks KW - modified-shortest-path KW - sota AU - Jain, Sushant AU - Fall, Kevin AU - Patra, Rabin PY - 2004/10// UR - http://dx.doi.org/10.1145/1030194.1015484 ER -