{"id":"https://openalex.org/W2056069725","doi":"https://doi.org/10.1137/s0097539791221499","title":"On-Line Algorithms for Path Selection in a Nonblocking Network","display_name":"On-Line Algorithms for Path Selection in a Nonblocking Network","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2056069725","doi":"https://doi.org/10.1137/s0097539791221499","mag":"2056069725"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791221499","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791221499","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110453378","display_name":"Frank Thomson 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":"F. T. Leighton","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046808993","display_name":"Bruce M. Maggs","orcid":"https://orcid.org/0000-0002-5692-7062"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce M. Maggs","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9632,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.94853801,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"25","issue":"3","first_page":"600","last_page":"625"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9983999729156494,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.7483488917350769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5940426588058472},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5731220245361328},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.567045271396637},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5486878752708435},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5017452239990234},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.49601611495018005},{"id":"https://openalex.org/keywords/context-switch","display_name":"Context switch","score":0.4959593713283539},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48103100061416626},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.45205989480018616},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45053809881210327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4284391403198242},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3419116139411926},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3367462754249573},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29471999406814575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22615966200828552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22385439276695251},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1890716552734375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7483488917350769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5940426588058472},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5731220245361328},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.567045271396637},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5486878752708435},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5017452239990234},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.49601611495018005},{"id":"https://openalex.org/C53833338","wikidata":"https://www.wikidata.org/wiki/Q1061424","display_name":"Context switch","level":2,"score":0.4959593713283539},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48103100061416626},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.45205989480018616},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45053809881210327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4284391403198242},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3419116139411926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3367462754249573},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29471999406814575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22615966200828552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22385439276695251},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1890716552734375},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539791221499","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791221499","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1587590810","https://openalex.org/W1970294411","https://openalex.org/W1973383391","https://openalex.org/W1977908721","https://openalex.org/W1987347501","https://openalex.org/W2010387743","https://openalex.org/W2010442238","https://openalex.org/W2011849452","https://openalex.org/W2035081987","https://openalex.org/W2042876290","https://openalex.org/W2047528205","https://openalex.org/W2097755092","https://openalex.org/W2114870379","https://openalex.org/W2117306309","https://openalex.org/W2126965802","https://openalex.org/W2130436146","https://openalex.org/W2132275736","https://openalex.org/W2138940156","https://openalex.org/W2155371437","https://openalex.org/W2155859297","https://openalex.org/W2745281314"],"related_works":["https://openalex.org/W2089439745","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,67],"first":[4],"optimal-time":[5],"algorithms":[6],"for":[7,37],"path":[8],"selection":[9],"in":[10,48,62,79,115],"an":[11,19,30,43,46],"optimal-size":[12],"nonblocking":[13,22],"network.":[14],"In":[15],"particular,":[16],"we":[17],"describe":[18],"N-input,":[20],"N-output,":[21],"network":[23],"with":[24],"$O(N\\log":[25],"N)$":[26,50,81,108,135],"bounded-degree":[27],"nodes,":[28],"and":[29,45,95],"algorithm":[31,68,122],"that":[32],"can":[33,69,92],"satisfy":[34],"any":[35,72,124,128],"request":[36],"a":[38,63,116],"connection":[39],"or":[40,147],"disconnection":[41],"between":[42],"input":[44],"output":[47],"$O(\\log":[49,80,107,134],"bit":[51,82,109,136],"steps,":[52,83,137],"even":[53,84],"if":[54,85],"many":[55,86],"requests":[56],"are":[57,88,148],"made":[58,145,150],"at":[59],"once.":[60],"Viewed":[61,114],"telephone":[64],"switching":[65],"context,":[66,120],"put":[70,105],"through":[71,106],"set":[73],"of":[74,131],"calls":[75,87],"among":[76],"N":[77],"parties":[78],"placed":[89],"simultaneously.":[90,151],"Parties":[91],"hang":[93],"up":[94],"call":[96,102],"again":[97],"whenever":[98],"they":[99],"like;":[100],"every":[101],"is":[103],"still":[104],"steps":[110],"after":[111],"being":[112,149],"placed.":[113],"distributed":[117],"memory":[118,132],"machine":[119],"our":[121],"allows":[123],"processor":[125],"to":[126],"access":[127],"idle":[129],"block":[130],"within":[133],"no":[138],"matter":[139],"what":[140],"other":[141],"connections":[142],"have":[143],"been":[144],"previously":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}