{"id":"https://openalex.org/W2016121137","doi":"https://doi.org/10.1145/1500676.1500762","title":"Three heuristics for improving centralized routing in large long-haul computer communication networks","display_name":"Three heuristics for improving centralized routing in large long-haul computer communication networks","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2016121137","doi":"https://doi.org/10.1145/1500676.1500762","mag":"2016121137"},"language":"en","primary_location":{"id":"doi:10.1145/1500676.1500762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1500676.1500762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the May 16-19, 1983, national computer conference on - AFIPS '83","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/A5005119429","display_name":"Ivan M. Pesic","orcid":null},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ivan M. Pesic","raw_affiliation_strings":["University of Santa Clara, Santa Clara, California","University of Santa Clara, Santa Clara, California#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Santa Clara, Santa Clara, California","institution_ids":["https://openalex.org/I16269868"]},{"raw_affiliation_string":"University of Santa Clara, Santa Clara, California#TAB#","institution_ids":["https://openalex.org/I16269868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111960857","display_name":"Daniel W. Lewis","orcid":null},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel W. Lewis","raw_affiliation_strings":["University of Santa Clara, Santa Clara, California","University of Santa Clara, Santa Clara, California#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Santa Clara, Santa Clara, California","institution_ids":["https://openalex.org/I16269868"]},{"raw_affiliation_string":"University of Santa Clara, Santa Clara, California#TAB#","institution_ids":["https://openalex.org/I16269868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005119429"],"corresponding_institution_ids":["https://openalex.org/I16269868"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1379168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"691","last_page":"691"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9975000023841858,"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/heuristics","display_name":"Heuristics","score":0.7872661352157593},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7220813035964966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.707443356513977},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6519423723220825},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5962384939193726},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5608538389205933},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5549752712249756},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4807155430316925},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4589473009109497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4443770945072174},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4325101971626282},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4273948669433594},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33905547857284546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3283264636993408},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.324335515499115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0987391471862793}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7872661352157593},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7220813035964966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.707443356513977},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6519423723220825},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5962384939193726},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5608538389205933},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5549752712249756},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4807155430316925},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4589473009109497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4443770945072174},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4325101971626282},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4273948669433594},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33905547857284546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3283264636993408},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.324335515499115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0987391471862793},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1500676.1500762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1500676.1500762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the May 16-19, 1983, national computer conference on - AFIPS '83","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W89655138","https://openalex.org/W178023480","https://openalex.org/W569830306","https://openalex.org/W1965680834","https://openalex.org/W2007572995","https://openalex.org/W2014411916","https://openalex.org/W2053723217","https://openalex.org/W2093611530","https://openalex.org/W2120450054","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2357391150","https://openalex.org/W2996337372","https://openalex.org/W2353596372","https://openalex.org/W2371371223","https://openalex.org/W2144050074","https://openalex.org/W2388051136","https://openalex.org/W2161960576","https://openalex.org/W1992129517","https://openalex.org/W2349797546","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Several":[0],"algorithms":[1,59],"have":[2,60],"proven":[3],"to":[4,75,124,127],"be":[5],"useful":[6],"in":[7,15,64,106],"computing":[8],"the":[9,22,28,32,43,107,114],"shortest":[10,44,115],"path":[11,116],"between":[12,117],"two":[13,118],"nodes":[14,36,79,120],"a":[16,47,51,85],"network.":[17],"Their":[18],"complexity":[19,54],"depends":[20],"on":[21,95],"problem":[23],"definition":[24],"and":[25,103],"size":[26],"of":[27,35,53,72,78,99,109,113],"network":[29],"measured":[30,96],"by":[31],"total":[33],"number":[34],"N.":[37],"In":[38],"these":[39],"algorithms,":[40],"finding":[41],"all":[42],"paths":[45],"from":[46],"fixed":[48],"node":[49],"is":[50,121],"computation":[52],"O(N":[55],"x":[56],"N).":[57],"These":[58],"been":[61],"used":[62],"successfully":[63],"long-haul":[65],"networks":[66,74,102],"for":[67],"many":[68],"years.":[69],"Recent":[70],"growth":[71],"such":[73],"large":[76],"numbers":[77],"(e.g.,":[80],"N":[81],">":[82],"500)":[83],"demands":[84],"more":[86],"efficient":[87],"approach.":[88],"This":[89],"paper":[90],"develops":[91],"three":[92],"heuristics":[93],"based":[94],"topological":[97],"characteristics":[98],"computer":[100],"communication":[101],"applies":[104],"them":[105],"construction":[108],"faster":[110],"algorithms.":[111],"Determination":[112],"random":[119],"then":[122],"shown":[123],"require":[125],"50":[126],"60%":[128],"less":[129],"computation.":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}