{"id":"https://openalex.org/W2101171272","doi":"https://doi.org/10.1109/icccn.2007.4317799","title":"A Caching-Based Approach to Routing in Delay-Tolerant Networks","display_name":"A Caching-Based Approach to Routing in Delay-Tolerant Networks","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2101171272","doi":"https://doi.org/10.1109/icccn.2007.4317799","mag":"2101171272"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2007.4317799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and 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/A5067864500","display_name":"Dan Henriksson","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Henriksson","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","University of Illinois at Urbana-Champaign Urbana"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana-Champaign Urbana","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087114395","display_name":"Tarek Abdelzaher","orcid":"https://orcid.org/0000-0003-3883-7220"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tarek F. Abdelzaher","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","University of Illinois at Urbana-Champaign Urbana"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana-Champaign Urbana","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011324325","display_name":"Raghu Ganti","orcid":"https://orcid.org/0000-0003-3658-7918"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghu K. Ganti","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","University of Illinois at Urbana-Champaign Urbana"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana-Champaign Urbana","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0211,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.87806462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"74"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9970999956130981,"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.9894000291824341,"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.814268946647644},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.7093597650527954},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6632845997810364},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6364314556121826},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6225835084915161},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.6188980340957642},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.6137747168540955},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5632690787315369},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5611563324928284},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5126063227653503},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5107266902923584},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5090822577476501},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.504831850528717},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.49998974800109863},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49889540672302246},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.46579229831695557},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.42071184515953064},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07938045263290405},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06684711575508118}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.814268946647644},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.7093597650527954},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6632845997810364},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6364314556121826},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6225835084915161},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6188980340957642},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.6137747168540955},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5632690787315369},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5611563324928284},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5126063227653503},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5107266902923584},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5090822577476501},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.504831850528717},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.49998974800109863},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49889540672302246},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.46579229831695557},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.42071184515953064},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07938045263290405},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06684711575508118},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2007.4317799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W171305513","https://openalex.org/W1881610084","https://openalex.org/W1918432491","https://openalex.org/W1974817122","https://openalex.org/W1993484402","https://openalex.org/W2010634640","https://openalex.org/W2030338951","https://openalex.org/W2100468043","https://openalex.org/W2107930846","https://openalex.org/W2112316694","https://openalex.org/W2137475084","https://openalex.org/W2140511560","https://openalex.org/W2142651281","https://openalex.org/W2147830904","https://openalex.org/W2157887870","https://openalex.org/W2162076967","https://openalex.org/W2200366263","https://openalex.org/W4234068324","https://openalex.org/W6639591483","https://openalex.org/W6640272449"],"related_works":["https://openalex.org/W1563839700","https://openalex.org/W1655019438","https://openalex.org/W2154440508","https://openalex.org/W106527558","https://openalex.org/W2351097701","https://openalex.org/W2077927962","https://openalex.org/W2114321370","https://openalex.org/W1924167960","https://openalex.org/W3152092244","https://openalex.org/W2260609643"],"abstract_inverted_index":{"Delay-tolerant":[0],"networks":[1],"(DTNs),":[2],"where":[3],"no":[4],"connected":[5],"path":[6],"generally":[7],"exists":[8],"between":[9,60],"a":[10,13,23,53,77,83],"source":[11],"and":[12,66,98],"destination":[14],"at":[15],"any":[16],"given":[17],"time,":[18],"present":[19],"significant":[20],"challenges":[21],"from":[22],"routing":[24,29,61,92],"perspective.":[25],"A":[26],"plethora":[27],"of":[28,38,45,85],"approaches":[30],"have":[31],"been":[32],"previously":[33,86],"introduced":[34],"that":[35],"make":[36],"use":[37],"node":[39,75],"mobility":[40],"models":[41,44],"or":[42],"probabilistic":[43],"network":[46],"topology.":[47],"In":[48,71],"this":[49,72],"paper,":[50],"we":[51],"offer":[52],"new":[54],"perspective":[55],"by":[56],"making":[57],"an":[58],"analogy":[59],"table":[62],"construction":[63],"in":[64,68],"DTNs":[65],"caching":[67,79],"program":[69],"execution.":[70],"approach,":[73],"each":[74],"uses":[76],"simple":[78],"heuristic":[80],"to":[81,89],"choose":[82],"subset":[84],"encountered":[87],"nodes":[88],"be":[90],"its":[91],"neighbors.":[93],"The":[94],"approach":[95],"is":[96],"evaluated":[97],"shows":[99],"good":[100],"performance":[101],"while":[102],"keeping":[103],"the":[104],"implementation":[105],"very":[106],"simple.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}