{"id":"https://openalex.org/W2035320281","doi":"https://doi.org/10.1145/181014.181451","title":"Minimal adaptive routing on the mesh with bounded queue size","display_name":"Minimal adaptive routing on the mesh with bounded queue size","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2035320281","doi":"https://doi.org/10.1145/181014.181451","mag":"2035320281"},"language":"en","primary_location":{"id":"doi:10.1145/181014.181451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/181014.181451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures  - SPAA '94","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/A5022193062","display_name":"Donald Chinn","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Donald D. Chinn","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Washington, Seattle, WA","Department of Computer Science and Engineering, University, of Washington, Seattle WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University, of Washington, Seattle WA#TAB#","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[{"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":"Tom Leighton","raw_affiliation_strings":["Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA","Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge MA#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge MA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008676408","display_name":"Martin Tompa","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Tompa","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Washington, Seattle, WA","Department of Computer Science and Engineering, University, of Washington, Seattle WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Washington, Seattle, WA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University, of Washington, Seattle WA#TAB#","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022193062"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":2.0757,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87401766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"354","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9980000257492065,"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.9962000250816345,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.8328603506088257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7257023453712463},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.6241592764854431},{"id":"https://openalex.org/keywords/dsrflow","display_name":"DSRFLOW","score":0.6169549822807312},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6167191863059998},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5906147956848145},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5711895227432251},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5590408444404602},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.48366841673851013},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.46811431646347046},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44349968433380127},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.43499070405960083},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.41065704822540283},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.40554553270339966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.336985319852829},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.22875073552131653}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.8328603506088257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7257023453712463},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.6241592764854431},{"id":"https://openalex.org/C193794138","wikidata":"https://www.wikidata.org/wiki/Q5206182","display_name":"DSRFLOW","level":5,"score":0.6169549822807312},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6167191863059998},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5906147956848145},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5711895227432251},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5590408444404602},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.48366841673851013},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.46811431646347046},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44349968433380127},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.43499070405960083},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.41065704822540283},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.40554553270339966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336985319852829},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.22875073552131653}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/181014.181451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/181014.181451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures  - SPAA '94","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":22,"referenced_works":["https://openalex.org/W21401474","https://openalex.org/W1493782275","https://openalex.org/W1519425125","https://openalex.org/W1968358793","https://openalex.org/W1980907788","https://openalex.org/W1999936218","https://openalex.org/W2004269480","https://openalex.org/W2010467579","https://openalex.org/W2020797856","https://openalex.org/W2026051858","https://openalex.org/W2052416052","https://openalex.org/W2069489095","https://openalex.org/W2071482359","https://openalex.org/W2097755092","https://openalex.org/W2098279176","https://openalex.org/W2109255484","https://openalex.org/W2116425892","https://openalex.org/W2119241866","https://openalex.org/W2129388233","https://openalex.org/W2146073682","https://openalex.org/W2166156679","https://openalex.org/W2790390957"],"related_works":["https://openalex.org/W4385819622","https://openalex.org/W2003936810","https://openalex.org/W2094080270","https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W2136594547","https://openalex.org/W1967396936","https://openalex.org/W1984835167","https://openalex.org/W1985364327","https://openalex.org/W1597161197"],"abstract_inverted_index":{"An":[0],"adaptive":[1,39],"routing":[2,33,40],"algorithm":[3],"is":[4,52],"one":[5],"in":[6],"which":[7],"the":[8,43,47],"path":[9,48],"a":[10,53],"packet":[11,50],"takes":[12,51],"from":[13],"its":[14,17],"source":[15],"to":[16],"destination":[18],"may":[19],"depend":[20],"on":[21],"other":[22],"packets":[23,34],"it":[24],"encounters.":[25],"Such":[26],"algorithms":[27,41],"potentially":[28],"avoid":[29],"network":[30],"bottlenecks":[31],"by":[32],"around":[35],"\u201chot":[36],"spots.\u201d":[37],"Minimal":[38],"have":[42],"additional":[44],"advantage":[45],"that":[46],"each":[49],"shortest":[54],"one.":[55]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}