{"id":"https://openalex.org/W2041069481","doi":"https://doi.org/10.5555/313651.313819","title":"Greedy dynamic routing on arrays","display_name":"Greedy dynamic routing on arrays","publication_year":1995,"publication_date":"1995-01-22","ids":{"openalex":"https://openalex.org/W2041069481","doi":"https://doi.org/10.5555/313651.313819","mag":"2041069481"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.3416","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.codiciel.fr/netlib/att/math/people/kahale/papers/rout.ps.Z","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5003810931","display_name":"Nabil Kahal\u00e9","orcid":"https://orcid.org/0000-0002-4009-6815","observed_orcids":["https://orcid.org/0000-0002-4009-6815"]},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nabil Kahal\u00e9","raw_affiliation_strings":["XEROX Palo Alto Research Center, 3333 Coyote Hill Road, CA"],"raw_orcid":"https://orcid.org/0000-0002-4009-6815","affiliations":[{"raw_affiliation_string":"XEROX Palo Alto Research Center, 3333 Coyote Hill Road, CA","institution_ids":["https://openalex.org/I173498003"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null,"observed_orcids":[]},"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, Massachsetts Institute of Technology, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department and Laboratory for Computer Science, Massachsetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.8377,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.96946821,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"2","first_page":"558","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9926999807357788,"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":0.9926999807357788,"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.0032999999821186066,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-routing","display_name":"dynamic routing","score":0.906000018119812},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9169999957084656},{"id":"https://openalex.org/keywords/parallel-machines","display_name":"parallel machines","score":0.3720000088214874},{"id":"https://openalex.org/keywords/poisson-arrivals","display_name":"Poisson arrivals","score":0.7879999876022339},{"id":"https://openalex.org/keywords/ring-networks","display_name":"ring networks","score":0.7419999837875366},{"id":"https://openalex.org/keywords/expected-delay","display_name":"expected delay","score":0.4259999990463257}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6251384615898132},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6188215613365173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6041021943092346},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5618476271629333},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.5165942907333374},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5139095783233643},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5004239082336426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42843097448349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3112031817436218},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19602370262145996},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.3416","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.codiciel.fr/netlib/att/math/people/kahale/papers/rout.ps.Z","raw_type":"text"},{"id":"mag:2041069481","doi":"https://doi.org/10.5555/313651.313819","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda95.html#KahaleL95","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1983804795","https://openalex.org/W1997468228","https://openalex.org/W2020797856","https://openalex.org/W2026124665","https://openalex.org/W2027373830","https://openalex.org/W2042587503","https://openalex.org/W2060004876","https://openalex.org/W2064960138","https://openalex.org/W2068871408"],"related_works":["https://openalex.org/W2020797856","https://openalex.org/W2064960138","https://openalex.org/W2060004876","https://openalex.org/W2027373830","https://openalex.org/W2092153172","https://openalex.org/W2148923010","https://openalex.org/W2060207156","https://openalex.org/W2169230919","https://openalex.org/W2053491613","https://openalex.org/W2155303087","https://openalex.org/W2147339935","https://openalex.org/W2097755092","https://openalex.org/W2084427019","https://openalex.org/W114148695","https://openalex.org/W2058355999","https://openalex.org/W2033008525","https://openalex.org/W2021539905","https://openalex.org/W1986632072","https://openalex.org/W1998368111","https://openalex.org/W1999936218"],"abstract_inverted_index":{"We":[0,9,82,97],"study":[1],"the":[2,24,28,52,55,68,87,94,100,104,111,115,121,124,135],"problem":[3],"of":[4,15,31,43,54,65,89,103,151],"dynamic":[5,25],"routing":[6],"on":[7,21,51],"arrays.":[8],"prove":[10],"that":[11],"a":[12,144,148],"large":[13,149],"class":[14],"greedy":[16,160],"algorithms":[17,164],"perform":[18],"very":[19],"well":[20,168],"average.":[22],"In":[23],"case,":[26],"when":[27,123],"arrival":[29],"rate":[30],"packets":[32,157],"in":[33,62],"an":[34,48],"N":[35,37,77],"\\\\Theta":[36],"array":[38,146],"is":[39,71],"at":[40],"most":[41],"99%":[42],"network":[44],"capacity,":[45],"we":[46,59],"establish":[47],"exponential":[49],"bound":[50],"tail":[53],"delay":[56,107],"distribution.":[57],"Moreover,":[58],"show":[60],"that,":[61],"any":[63],"window":[64],"T":[66],"steps,":[67],"maximum":[69],"queue-size":[70],"O(1":[72],"+":[73],"log":[74,76],"T=":[75],")":[78],"with":[79],"high":[80],"probability.":[81],"extend":[83],"these":[84,163],"results":[85],"to":[86,93,166],"case":[88],"bit-serial":[90],"routing,":[91],"and":[92,108,119,138],"static":[95],"case.":[96],"also":[98],"calculate":[99],"exact":[101],"value":[102],"ergodic":[105],"expected":[106],"queue-sizes":[109],"under":[110],"farthest-first":[112],"protocol":[113],"for":[114,120],"one":[116],"dimensional":[117],"array,":[118],"ring":[122],"arrivals":[125],"are":[126,141],"Poisson.":[127],"1":[128],"Introduction":[129],"Many":[130],"parallel":[131],"machines,":[132],"such":[133],"as":[134,143],"MPP,":[136],"Ametek":[137],"Intel":[139],"Touchstone":[140],"configured":[142],"low-dimensional":[145],"containing":[147],"number":[150],"processors.":[152],"These":[153],"machines":[154],"generally":[155],"route":[156],"using":[158],"simple":[159],"algorithms.":[161],"While":[162],"tend":[165],"behave":[167],"experi...":[169]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}