{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:08:46Z","timestamp":1775228926557,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T00:00:00Z","timestamp":1093824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,30]]},"DOI":"10.1145\/1015467.1015484","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T13:39:48Z","timestamp":1097156388000},"page":"145-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":811,"title":["Routing in a delay tolerant network"],"prefix":"10.1145","author":[{"given":"Sushant","family":"Jain","sequence":"first","affiliation":[{"name":"University of Washington"}]},{"given":"Kevin","family":"Fall","sequence":"additional","affiliation":[{"name":"Intel Research, Berkeley"}]},{"given":"Rabin","family":"Patra","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2004,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"key":"e_1_3_2_1_3_1","unstructured":"AMSAT. http:\/\/www.amsat.org\/.  AMSAT. http:\/\/www.amsat.org\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/288235.288256"},{"key":"e_1_3_2_1_5_1","volume-title":"Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing","author":"Chen X.","year":"2001","unstructured":"X. Chen and A. L. Murphy . Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing , August 2001 . X. Chen and A. L. Murphy. Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing, August 2001."},{"key":"e_1_3_2_1_6_1","unstructured":"CPLEX\n  : Linear Programming Solver. http:\/\/www.ilog.com\/.  CPLEX: Linear Programming Solver. http:\/\/www.ilog.com\/."},{"key":"e_1_3_2_1_7_1","unstructured":"CPLEX\n  : Linear Programming Solver. http:\/\/www.ilog.com\/.  CPLEX: Linear Programming Solver. http:\/\/www.ilog.com\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863960"},{"key":"e_1_3_2_1_9_1","volume-title":"Flows in Networks","author":"Ford L. R.","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton University Press , 1962 . L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962."},{"key":"e_1_3_2_1_10_1","volume-title":"MIT","author":"Gao S.","year":"2002","unstructured":"S. Gao . Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis , MIT , 2002 . S. Gao. Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis, MIT, 2002."},{"key":"e_1_3_2_1_11_1","volume-title":"PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference","author":"Honeymoon P.","year":"1986","unstructured":"P. Honeymoon and S. Bellovin . PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference , 1986 . P. Honeymoon and S. Bellovin. PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference, 1986."},{"key":"e_1_3_2_1_12_1","volume-title":"SODA","author":"Hoppe B.","year":"1996","unstructured":"B. Hoppe and \u00c9. Tardos. The Quickest Transshipment Problem . In SODA , Jan. 1996 . B. Hoppe and \u00c9. Tardos. The Quickest Transshipment Problem. In SODA, Jan. 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605408"},{"key":"e_1_3_2_1_14_1","volume-title":"INRIA","author":"Kotnyek B.","year":"2003","unstructured":"B. Kotnyek . An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936 , INRIA , Sept. 2003 . B. Kotnyek. An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936, INRIA, Sept. 2003."},{"key":"e_1_3_2_1_15_1","unstructured":"J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\/\/www.qsl.net\/kd2bd\/predict.html\/.  J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\/\/www.qsl.net\/kd2bd\/predict.html\/."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2001.992756"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.939012"},{"key":"e_1_3_2_1_18_1","first-page":"303","article-title":"Minimum-delay Routing","volume":"18","author":"Ogier R.","year":"1988","unstructured":"R. Ogier . Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks , 18 : 303 -- 318 , 1988 . R. Ogier. Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks, 18:303--318, 1988.","journal-title":"Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214078"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1260729"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060319"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPA.2003.1203354"},{"key":"e_1_3_2_1_23_1","unstructured":"TIER Project. http:\/\/tier.cs.berkeley.edu\/.  TIER Project. http:\/\/tier.cs.berkeley.edu\/."},{"key":"e_1_3_2_1_25_1","unstructured":"Wizzy Project. http:\/\/www.wizzy.org.za\/.  Wizzy Project. http:\/\/www.wizzy.org.za\/."}],"event":{"name":"SIGCOMM04: ACM SIGCOMM 2004 Conference","location":"Portland Oregon USA","acronym":"SIGCOMM04","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1015467.1015484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:23:45Z","timestamp":1750253025000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015467.1015484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,30]]},"references-count":23,"alternative-id":["10.1145\/1015467.1015484","10.1145\/1015467"],"URL":"https:\/\/doi.org\/10.1145\/1015467.1015484","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1030194.1015484","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,8,30]]},"assertion":[{"value":"2004-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}