{"id":"https://openalex.org/W2121598558","doi":"https://doi.org/10.1109/tit.1987.1057274","title":"Asymptotic optimality of shortest path routing algorithms","display_name":"Asymptotic optimality of shortest path routing algorithms","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2121598558","doi":"https://doi.org/10.1109/tit.1987.1057274","mag":"2121598558"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1987.1057274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1987.1057274","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5031972040","display_name":"Eli Gafni","orcid":"https://orcid.org/0009-0008-6799-2784"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. Gafni","raw_affiliation_strings":["Computer Science Department, University of California, Los Angeles, CA, USA","University of California\u2013Los Angeles"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California\u2013Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Bertsekas","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","[Massachusetts Inst. of Technol., Cambridge]"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"]},{"raw_affiliation_string":"[Massachusetts Inst. of Technol., Cambridge]","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031972040"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":0.5107,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.73459842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"1","first_page":"83","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997000098228455,"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.9993000030517578,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.8305613994598389},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7615419626235962},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.73673015832901},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6783864498138428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6281815767288208},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6177031397819519},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6138407588005066},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.5702598094940186},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5400295257568359},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4876440763473511},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4789426922798157},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4487093389034271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44583842158317566},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.43858349323272705},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43401309847831726},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4195806086063385},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3461496829986572},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.31521207094192505},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24060103297233582},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19364720582962036}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.8305613994598389},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7615419626235962},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.73673015832901},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6783864498138428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6281815767288208},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6177031397819519},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6138407588005066},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.5702598094940186},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5400295257568359},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4876440763473511},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4789426922798157},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4487093389034271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44583842158317566},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.43858349323272705},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43401309847831726},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4195806086063385},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3461496829986572},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.31521207094192505},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24060103297233582},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19364720582962036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.1987.1057274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1987.1057274","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.392.498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://switzernet.com/people/emin-gabrielyan/060112-capillary-references/ref/Gafni87.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.2000","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.2000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/2862/1/P-1307-15633509.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1519983908","https://openalex.org/W1970552818","https://openalex.org/W1980084436","https://openalex.org/W1997996213","https://openalex.org/W2015048412","https://openalex.org/W2021136283","https://openalex.org/W2061028747","https://openalex.org/W2088045969","https://openalex.org/W2095419571","https://openalex.org/W2120450054","https://openalex.org/W2121756644","https://openalex.org/W2133445191","https://openalex.org/W2134812261","https://openalex.org/W2146619410","https://openalex.org/W2150519657","https://openalex.org/W2155681385","https://openalex.org/W2159049132","https://openalex.org/W2604599974","https://openalex.org/W2613173048","https://openalex.org/W2747683607","https://openalex.org/W4247772122","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2368964068","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2122302754","https://openalex.org/W1618717300","https://openalex.org/W3094029073","https://openalex.org/W2121598558","https://openalex.org/W2082315389","https://openalex.org/W2137426847","https://openalex.org/W1971660230"],"abstract_inverted_index":{"Many":[0],"communication":[1],"networks":[2,58],"use":[3],"adaptive":[4],"shortest":[5,42,82],"path":[6,43,83],"routing.":[7],"By":[8],"this":[9,70],"we":[10],"mean":[11],"that":[12,21,52],"each":[13],"network":[14],"link":[15,48],"is":[16,38],"periodically":[17],"assigned":[18],"a":[19,41,60],"length":[20,36],"depends":[22],"on":[23],"its":[24],"congestion":[25],"level":[26],"during":[27],"the":[28,46],"preceding":[29],"period,":[30],"and":[31,66],"all":[32],"traffic":[33],"generated":[34],"between":[35],"updates":[37],"routed":[39],"along":[40],"corresponding":[44],"to":[45],"latest":[47],"lengths.":[49],"We":[50],"show":[51],"in":[53,75],"certain":[54],"situations,":[55],"typical":[56],"of":[57,63],"involving":[59],"large":[61],"number":[62],"small":[64],"users":[65],"utilizing":[67],"virtual":[68],"circuits,":[69],"routing":[71,84],"method":[72],"performs":[73],"optimally":[74],"an":[76],"asymptotic":[77],"sense.":[78],"In":[79],"other":[80],"cases,":[81],"can":[85],"be":[86],"far":[87],"from":[88],"optimal.":[89]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}