{"id":"https://openalex.org/W1986647006","doi":"https://doi.org/10.1016/0169-7552(89)90011-1","title":"A minimum-hop routing algorithm based on distributed information","display_name":"A minimum-hop routing algorithm based on distributed information","publication_year":1989,"publication_date":"1989-05-01","ids":{"openalex":"https://openalex.org/W1986647006","doi":"https://doi.org/10.1016/0169-7552(89)90011-1","mag":"1986647006"},"language":"en","primary_location":{"id":"doi:10.1016/0169-7552(89)90011-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0169-7552(89)90011-1","pdf_url":null,"source":{"id":"https://openalex.org/S3084184","display_name":"Computer Networks and ISDN Systems","issn_l":"0169-7552","issn":["0169-7552","1879-2324"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks and ISDN Systems","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/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J.J Garcia-Luna-Aceves","raw_affiliation_strings":["SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, U.S.A","SRI International, 333 Ravenswood Avenue, Menlo Park, CA, 94025, U.S.A"],"affiliations":[{"raw_affiliation_string":"SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, U.S.A","institution_ids":["https://openalex.org/I1298353152"]},{"raw_affiliation_string":"SRI International, 333 Ravenswood Avenue, Menlo Park, CA, 94025, U.S.A","institution_ids":["https://openalex.org/I1298353152"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065935907"],"corresponding_institution_ids":["https://openalex.org/I1298353152"],"apc_list":null,"apc_paid":null,"fwci":6.5899,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.96484424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"16","issue":"5","first_page":"367","last_page":"382"},"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.9934999942779541,"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.9934999942779541,"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.9922999739646912,"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.9839000105857849,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8241578340530396},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7219562530517578},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6567814350128174},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.646904468536377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6143808960914612},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.603336751461029},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5517251491546631},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5178242325782776},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4954320192337036},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.48313185572624207},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45060208439826965},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.43445801734924316},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4268583655357361},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.40112295746803284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2850503921508789},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2846868932247162},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23036637902259827},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.21652460098266602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17773962020874023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8241578340530396},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7219562530517578},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6567814350128174},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.646904468536377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6143808960914612},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.603336751461029},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5517251491546631},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5178242325782776},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4954320192337036},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.48313185572624207},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45060208439826965},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.43445801734924316},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4268583655357361},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.40112295746803284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2850503921508789},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2846868932247162},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23036637902259827},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.21652460098266602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17773962020874023},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0169-7552(89)90011-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0169-7552(89)90011-1","pdf_url":null,"source":{"id":"https://openalex.org/S3084184","display_name":"Computer Networks and ISDN Systems","issn_l":"0169-7552","issn":["0169-7552","1879-2324"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks and ISDN Systems","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":20,"referenced_works":["https://openalex.org/W62284320","https://openalex.org/W1952568655","https://openalex.org/W1964119857","https://openalex.org/W1978162659","https://openalex.org/W1985988333","https://openalex.org/W1994980566","https://openalex.org/W2003478478","https://openalex.org/W2029187109","https://openalex.org/W2056643723","https://openalex.org/W2114872178","https://openalex.org/W2147433692","https://openalex.org/W2159839546","https://openalex.org/W2543260727","https://openalex.org/W2543847065","https://openalex.org/W6602552178","https://openalex.org/W6644659786","https://openalex.org/W6649213416","https://openalex.org/W6676784775","https://openalex.org/W6682166416","https://openalex.org/W6729222129"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2147862592","https://openalex.org/W2372677512","https://openalex.org/W1562631103","https://openalex.org/W1508906807","https://openalex.org/W2348177054","https://openalex.org/W2387829241","https://openalex.org/W2173748631"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}