{"id":"https://openalex.org/W2116485556","doi":"https://doi.org/10.1145/1287791.1287794","title":"Towards a formalism for routing in challenged networks","display_name":"Towards a formalism for routing in challenged networks","publication_year":2007,"publication_date":"2007-09-14","ids":{"openalex":"https://openalex.org/W2116485556","doi":"https://doi.org/10.1145/1287791.1287794","mag":"2116485556"},"language":"en","primary_location":{"id":"doi:10.1145/1287791.1287794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287791.1287794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the second ACM workshop on Challenged networks","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003572109","display_name":"Ram Ramanathan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ram Ramanathan","raw_affiliation_strings":["BBN Technologies, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"BBN Technologies, Cambridge, MA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057455780","display_name":"Prithwish Basu","orcid":"https://orcid.org/0000-0001-8295-1878"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prithwish Basu","raw_affiliation_strings":["BBN Technologies, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"BBN Technologies, Cambridge, MA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051985321","display_name":"Rajesh Krishnan","orcid":"https://orcid.org/0000-0001-6798-6255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajesh Krishnan","raw_affiliation_strings":["BBN Technologies, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"BBN Technologies, Cambridge, MA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003572109"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.0623,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96420952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7325426936149597},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6154857873916626},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.48565781116485596},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47277119755744934},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41001302003860474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21550291776657104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7325426936149597},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6154857873916626},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.48565781116485596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47277119755744934},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41001302003860474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21550291776657104},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1287791.1287794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1287791.1287794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the second ACM workshop on Challenged networks","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.8719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.8719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ir.bbn.com/projects/spindle/ramanath-chants07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.8408","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.8408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ir.bbn.com/~ramanath/pdf/formalism-chants07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1555016291","https://openalex.org/W1572481965","https://openalex.org/W1585776999","https://openalex.org/W1589141582","https://openalex.org/W1965396227","https://openalex.org/W1966518282","https://openalex.org/W2002089154","https://openalex.org/W2010634640","https://openalex.org/W2071738571","https://openalex.org/W2096841105","https://openalex.org/W2097625638","https://openalex.org/W2099236627","https://openalex.org/W2123825896","https://openalex.org/W2125957038","https://openalex.org/W2147206873","https://openalex.org/W2147830904","https://openalex.org/W2151342861","https://openalex.org/W2162076967","https://openalex.org/W2165513513","https://openalex.org/W2200366263","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"Research":[0],"on":[1,32,85],"challenged":[2,41,62,70,139],"or":[3,126],"delay/disruption-tolerant":[4],"networks":[5,71],"has":[6],"exploded":[7],"in":[8,40,61,94,159],"the":[9,23,33,37,56,86,97,134,146,161],"past":[10],"few":[11,29],"years":[12],"with":[13],"a":[14,44,52,81,155],"plethora":[15],"of":[16,22,36,69,75,83,88,91,96,109,138,157],"algorithms":[17],"targeted":[18],"at":[19],"different":[20],"versions":[21],"problem.":[24],"Yet,":[25],"there":[26],"have":[27],"been":[28],"formal":[30,53],"studies":[31],"fundamental":[34,67],"nature":[35],"routing":[38,76,92],"problem":[39,57],"networks.":[42,63],"As":[43],"step":[45],"toward":[46],"closing":[47],"this":[48],"gap,":[49],"we":[50,152],"introduce":[51],"framework":[54],"relating":[55],"and":[58,72,148,172],"solution":[59],"spaces":[60],"We":[64,78,104,141],"define":[65],"three":[66,118],"types":[68,99],"several":[73],"classes":[74],"mechanisms.":[77],"then":[79],"prove":[80],"number":[82,156],"results":[84,144],"power":[87],"each":[89],"class":[90],"mechanism":[93],"terms":[95],"network":[98,119],"that":[100,106],"it":[101],"can":[102,112],"solve.":[103],"show":[105],"simple":[107],"variants":[108],"MANET":[110],"protocols":[111],"solve":[113,132],"two":[114],"but":[115],"not":[116],"all":[117],"types.":[120],"However,":[121],"either":[122],"complete":[123],"schedule":[124],"awareness":[125],"maximal":[127],"replication":[128],"is":[129],"sufficient":[130],"to":[131,145],"even":[133],"most":[135],"general":[136],"type":[137],"network.":[140],"extend":[142],"these":[143],"bounded-storage":[147],"bounded-bandwidth":[149],"cases.":[150],"Finally,":[151],"briefly":[153],"discuss":[154],"avenues":[158],"which":[160],"core":[162],"formalism":[163],"may":[164],"be":[165],"extended,":[166],"including":[167],"an":[168],"infinite":[169],"opportunity":[170],"model":[171],"graph":[173],"theoretic":[174],"extensions.":[175]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}