{"id":"https://openalex.org/W2769814494","doi":"https://doi.org/10.1177/1550147717741264","title":"CASPaR: Congestion avoidance shortest path routing for delay tolerant networks","display_name":"CASPaR: Congestion avoidance shortest path routing for delay tolerant networks","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2769814494","doi":"https://doi.org/10.1177/1550147717741264","mag":"2769814494"},"language":"en","primary_location":{"id":"doi:10.1177/1550147717741264","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741264","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741264","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741264","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110896463","display_name":"Michael Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Stewart","raw_affiliation_strings":["Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042560222","display_name":"Rajgopal Kannan","orcid":"https://orcid.org/0000-0001-8736-3012"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajgopal Kannan","raw_affiliation_strings":["US Army Research Laboratory, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"US Army Research Laboratory, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I166416128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081239516","display_name":"Amit Dvir","orcid":"https://orcid.org/0000-0002-3670-0784"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Amit Dvir","raw_affiliation_strings":["Cyber Technology Innovation Center, Department of Computer Science, Ariel University, Ariel, Israel"],"affiliations":[{"raw_affiliation_string":"Cyber Technology Innovation Center, Department of Computer Science, Ariel University, Ariel, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063784062","display_name":"Bhaskar Krishnamachari","orcid":"https://orcid.org/0000-0002-9994-9931"},"institutions":[{"id":"https://openalex.org/I166416128","display_name":"DEVCOM Army Research Laboratory","ror":"https://ror.org/011hc8f90","country_code":"US","type":"government","lineage":["https://openalex.org/I1304082316","https://openalex.org/I1330347796","https://openalex.org/I166416128","https://openalex.org/I2802705668","https://openalex.org/I4210154437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Krishnamachari","raw_affiliation_strings":["US Army Research Laboratory, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"US Army Research Laboratory, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I166416128"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5081239516"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":{"value":2200,"currency":"USD","value_usd":2200},"fwci":0.6216,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73394753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"11","first_page":"155014771774126","last_page":"155014771774126"},"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.9962999820709229,"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/T13553","display_name":"Age of Information Optimization","score":0.9954000115394592,"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.7971583604812622},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7668559551239014},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.693421483039856},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5622056126594543},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.529682993888855},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4715335965156555},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.46563875675201416},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.44816941022872925},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.42404884099960327},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4109393358230591},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.40712299942970276},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.2967384457588196},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2307179570198059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07752108573913574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7971583604812622},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7668559551239014},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.693421483039856},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5622056126594543},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.529682993888855},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4715335965156555},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.46563875675201416},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.44816941022872925},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.42404884099960327},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4109393358230591},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.40712299942970276},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.2967384457588196},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2307179570198059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07752108573913574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1177/1550147717741264","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741264","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741264","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741264","is_oa":false,"landing_page_url":"https://journals.sagepub.com/doi/10.1177/1550147717741264","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:ea96e245648b4e649ebfd98e2653d6fa","is_oa":true,"landing_page_url":"https://doaj.org/article/ea96e245648b4e649ebfd98e2653d6fa","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Distributed Sensor Networks, Vol 13 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1177/1550147717741264","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741264","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741264","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2769814494.pdf","grobid_xml":"https://content.openalex.org/works/W2769814494.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W25001425","https://openalex.org/W1990919499","https://openalex.org/W2010634640","https://openalex.org/W2039157284","https://openalex.org/W2042987594","https://openalex.org/W2056093707","https://openalex.org/W2083108207","https://openalex.org/W2156286761","https://openalex.org/W2172290124","https://openalex.org/W3006905685","https://openalex.org/W4245071476","https://openalex.org/W4255210669"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2122302754","https://openalex.org/W2121598558","https://openalex.org/W1971025399","https://openalex.org/W584056383","https://openalex.org/W2292682977","https://openalex.org/W4247331433"],"abstract_inverted_index":{"Unlike":[0],"traditional":[1],"transmission":[2],"control":[3],"protocol/Internet":[4],"protocol\u00e2\u20ac\u201cbased":[5],"networks,":[6],"delay/disruption":[7,27,48],"tolerant":[8,28,49],"networks":[9,29,71],"may":[10],"experience":[11],"connectivity":[12,18,147],"disruptions":[13],"and":[14,21,40,57,72,113,137,171,173],"guarantee":[15],"no":[16],"end-to-end":[17],"between":[19,131],"source":[20],"destination.":[22],"As":[23],"the":[24,35,74,77,80,186,200],"popularity":[25],"of":[26,79,145,149,167,180,188,192,205],"continues":[30],"to":[31,65,93,99,108,134,202,211],"rise,":[32],"so":[33],"does":[34],"need":[36],"for":[37],"a":[38,190,219],"robust":[39],"low-latency":[41],"routing":[42,51,90,126,161,197],"protocol.":[43],"A":[44],"one-copy,":[45],"shortest":[46,83,88,124,139,159,195],"path":[47,84,89,125,160,196],"network":[50,60,214],"protocol":[52],"that":[53,156],"addresses":[54],"congestion":[55,81,122,157,193],"avoidance":[56,82,87,112,123,158,194],"maximizes":[58],"total":[59],"bandwidth":[61],"utility":[62],"is":[63,73,91,174,226],"crucial":[64],"efficient":[66,177],"packet":[67,168],"delivery":[68,169],"in":[69,165,178,208],"high-load":[70],"motivation":[75],"behind":[76],"development":[78],"routing.":[85],"Congestion":[86,111],"designed":[92],"either":[94],"route":[95],"undeliverable":[96],"packets":[97],"\u00e2\u20ac\u0153closer\u00e2\u20ac":[98],"their":[100],"destinations":[101],"or":[102],"hold":[103],"onto":[104],"them":[105],"when":[106,223],"advantageous":[107],"do":[109],"so.":[110],"bottleneck":[114],"minimization":[115],"are":[116],"integrated":[117],"into":[118],"its":[119,150],"design.":[120],"Moreover,":[121],"negotiates":[127],"node":[128,146],"queue":[129],"differentials":[130],"neighbors":[132],"similar":[133],"backpressure":[135],"algorithms":[136],"maps":[138],"paths":[140],"without":[141],"any":[142],"direct":[143],"knowledge":[144],"outside":[148],"own":[151],"neighborhood.":[152],"Simulation":[153],"results":[154,217],"show":[155],"outperforms":[162],"well-known":[163],"protocols":[164],"terms":[166,179],"probability":[170],"latency":[172],"still":[175],"quite":[176],"overhead":[181],"requirements.":[182],"Finally,":[183],"we":[184],"explore":[185],"effectiveness":[187],"modeling":[189],"variant":[191],"based":[198],"on":[199],"resistance":[201],"current":[203],"flow":[204],"electrical":[206],"circuits":[207],"an":[209],"attempt":[210],"further":[212],"reduce":[213],"congestion.":[215],"Preliminary":[216],"indicate":[218],"noticeable":[220],"performance":[221],"increase":[222],"this":[224],"method":[225],"used.":[227]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}