{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:46Z","timestamp":1750308766574,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T00:00:00Z","timestamp":1189728000000},"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":[[2007,9,14]]},"DOI":"10.1145\/1287791.1287794","type":"proceedings-article","created":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T17:32:33Z","timestamp":1190827953000},"page":"3-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Towards a formalism for routing in challenged networks"],"prefix":"10.1145","author":[{"given":"Ram","family":"Ramanathan","sequence":"first","affiliation":[{"name":"BBN Technologies, Cambridge, MA"}]},{"given":"Prithwish","family":"Basu","sequence":"additional","affiliation":[{"name":"BBN Technologies, Cambridge, MA"}]},{"given":"Rajesh","family":"Krishnan","sequence":"additional","affiliation":[{"name":"BBN Technologies, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2007,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Wizzy project. http:\/\/www.wizzy.org.za.  Wizzy project. http:\/\/www.wizzy.org.za."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282422"},{"key":"e_1_3_2_1_3_1","volume-title":"LNCS","author":"Boudec J.-Y.","year":"2001","unstructured":"J.-Y. Boudec and P. Thiran . Network Calculus: A Theory of Deterministic Queueing Systems for the Internet Springer , LNCS , 2001 . J.-Y. Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queueing Systems for the Internet Springer, LNCS, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1497909"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.559799"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605408"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1204759"},{"key":"e_1_3_2_1_8_1","volume-title":"July","author":"V.","year":"2004","unstructured":"V. C. et al. Delay-tolerant network architecture , July 2004 . Internet-Draft . V. C. et al. Delay-tolerant network architecture, July 2004. Internet-Draft."},{"key":"e_1_3_2_1_9_1","volume-title":"In Proc. ALGOTEL","author":"Ferreira A.","year":"2002","unstructured":"A. Ferreira . On models and algorithms for dynamic communication networks: the case for evolving graphs . In In Proc. ALGOTEL 2002 . A. Ferreira. On models and algorithms for dynamic communication networks: the case for evolving graphs. In In Proc. ALGOTEL 2002."},{"key":"e_1_3_2_1_10_1","volume-title":"Graph Theory Addison Wesley","author":"Harary F.","year":"1995","unstructured":"F. Harary . Graph Theory Addison Wesley , 1995 . F. Harary. Graph Theory Addison Wesley, 1995."},{"key":"e_1_3_2_1_11_1","volume-title":"Delay tolerant mobile networks (dtmns): Controlled flooding schemes in sparse mobile networks","author":"Harras K.","year":"2005","unstructured":"K. Harras , K. Almeroth , and E. Belding-Royer . Delay tolerant mobile networks (dtmns): Controlled flooding schemes in sparse mobile networks , 2005 . K. Harras, K. Almeroth, and E. Belding-Royer. Delay tolerant mobile networks (dtmns): Controlled flooding schemes in sparse mobile networks, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"Introduction to Automata Theory","author":"Hopcroft J.","year":"1979","unstructured":"J. Hopcroft and J. Ullman . Introduction to Automata Theory , Languages and Computation Addison Wesley , 1979 . J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation Addison Wesley, 1979."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080106"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015484"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080141"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_3_2_1_17_1","volume-title":"The disruption tolerant networking program","author":"Marshall P.","year":"2005","unstructured":"P. Marshall . The disruption tolerant networking program , 2005 . http:\/\/www.darpa.mil\/sto\/solicitations\/DTN\/briefs.htm. P. Marshall. The disruption tolerant networking program, 2005. http:\/\/www.darpa.mil\/sto\/solicitations\/DTN\/briefs.htm."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1260729"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247694.1247707"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857111"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_3_2_1_23_1","volume-title":"Epidemic routing for partially connected ad hoc networks","author":"Vahdat A.","year":"2000","unstructured":"A. Vahdat and D. Becker . Epidemic routing for partially connected ad hoc networks , 2000 . A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks, 2000."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11753810_69"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2006.323440"}],"event":{"name":"MobiCom\/MobiHoc '07: The Thirteenth Annual International Conference on Mobile Computing and Networking and The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Montreal Quebec Canada","acronym":"MobiCom\/MobiHoc '07"},"container-title":["Proceedings of the second ACM workshop on Challenged networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287791.1287794","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1287791.1287794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287791.1287794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,14]]},"references-count":24,"alternative-id":["10.1145\/1287791.1287794","10.1145\/1287791"],"URL":"https:\/\/doi.org\/10.1145\/1287791.1287794","relation":{},"subject":[],"published":{"date-parts":[[2007,9,14]]},"assertion":[{"value":"2007-09-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}