{"id":"https://openalex.org/W2055891819","doi":"https://doi.org/10.1137/0214062","title":"Distributed Multi-Destination Routing: The Constraints of Local Information","display_name":"Distributed Multi-Destination Routing: The Constraints of Local Information","publication_year":1985,"publication_date":"1985-11-01","ids":{"openalex":"https://openalex.org/W2055891819","doi":"https://doi.org/10.1137/0214062","mag":"2055891819"},"language":"en","primary_location":{"id":"doi:10.1137/0214062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214062","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5048065826","display_name":"Jeffrey M. Jaffe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeffrey M. Jaffe","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048065826"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0068,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.80052817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"4","first_page":"875","last_page":"888"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10829","display_name":"Interconnection Networks and Systems","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.6825951933860779},{"id":"https://openalex.org/keywords/unavailability","display_name":"Unavailability","score":0.6186164021492004},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.615009069442749},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.6036386489868164},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.566106379032135},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5317847728729248},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4789603054523468},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45497724413871765},{"id":"https://openalex.org/keywords/intuition","display_name":"Intuition","score":0.4395718574523926},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4167743921279907},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4152994155883789},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36620962619781494},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.34470751881599426},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3070511519908905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21395975351333618}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6825951933860779},{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.6186164021492004},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.615009069442749},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.6036386489868164},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.566106379032135},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5317847728729248},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4789603054523468},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45497724413871765},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.4395718574523926},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4167743921279907},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4152994155883789},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36620962619781494},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.34470751881599426},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3070511519908905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21395975351333618},{"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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214062","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2005845593","https://openalex.org/W2086709935","https://openalex.org/W2087304736","https://openalex.org/W2112940483","https://openalex.org/W2120450054","https://openalex.org/W2146619410","https://openalex.org/W2151250580","https://openalex.org/W2604599974"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W2406963874","https://openalex.org/W2751383119","https://openalex.org/W2604779282","https://openalex.org/W2543752581","https://openalex.org/W2361465121","https://openalex.org/W2607223747"],"abstract_inverted_index":{"In":[0],"computer":[1],"networks,":[2],"message":[3],"routing":[4,22,36,61],"is":[5,44,52,65,112,115],"often":[6],"accomplished":[7],"by":[8,31],"network":[9,56],"nodes":[10],"using":[11],"local":[12,109,119],"information.":[13],"The":[14],"unavailability":[15],"of":[16,40,78,88,91],"global":[17],"information":[18,50,92,110,120],"intuitively":[19],"makes":[20],"hard":[21,34],"problems":[23],"virtually":[24],"impossible.":[25],"This":[26],"paper":[27],"formalizes":[28],"this":[29,79],"intuition":[30],"examining":[32],"a":[33,73,95],"(NP-complete)":[35],"problem,":[37],"the":[38,59,83,89,98,102],"problem":[39,103],"multi-destination":[41,60],"routing.":[42],"It":[43],"shown":[45],"that":[46],"with":[47],"only":[48],"limited":[49],"it":[51,64],"impossible":[53,66],"to":[54,67,71,100],"optimize":[55],"utilization":[57],"for":[58],"problem.":[62],"Moreover,":[63],"even":[68],"approximate":[69],"optimality":[70],"within":[72],"specific":[74],"tolerance.":[75],"Several":[76],"versions":[77,84],"result":[80],"are":[81],"proved;":[82],"differ":[85],"in":[86],"terms":[87],"amount":[90],"available":[93],"at":[94],"node,":[96],"and":[97],"extent":[99],"which":[101,114],"cannot":[104],"be":[105],"approximated.":[106],"An":[107],"improved":[108],"algorithm":[111],"presented":[113],"best":[116],"possible":[117],"amongst":[118],"algorithms.":[121]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}