{"id":"https://openalex.org/W1984501778","doi":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","title":"Routing algorithms for switching networks with probabilistic traffic","display_name":"Routing algorithms for switching networks with probabilistic traffic","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W1984501778","doi":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","mag":"1984501778"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5075403730","display_name":"Geng Lin","orcid":"https://orcid.org/0000-0002-1643-6859"},"institutions":[{"id":"https://openalex.org/I153908563","display_name":"Nortel (Canada)","ror":"https://ror.org/03rz4pm90","country_code":"CA","type":"company","lineage":["https://openalex.org/I153908563"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Geng Lin","raw_affiliation_strings":["Bell-Northern Research, P.O. Box 3511, Station C, Ottawa, Ontario K1Y 4H7, Canada","Bell-Northern Research, P.O. Box 3511, Station C, Ottawa, Ontario K1Y 4H7, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Bell-Northern Research, P.O. Box 3511, Station C, Ottawa, Ontario K1Y 4H7, Canada","institution_ids":["https://openalex.org/I153908563"]},{"raw_affiliation_string":"Bell-Northern Research, P.O. Box 3511, Station C, Ottawa, Ontario K1Y 4H7, Canada#TAB#","institution_ids":["https://openalex.org/I153908563"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113582583","display_name":"Nicholas Pippenger","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nicholas Pippenger","raw_affiliation_strings":["Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada","Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada#TAB#","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075403730"],"corresponding_institution_ids":["https://openalex.org/I153908563"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0631,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79621305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"28","issue":"1","first_page":"21","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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.9995999932289124,"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.992900013923645,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.992900013923645,"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.7234522104263306},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6164921522140503},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6143860816955566},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5614219307899475},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5455597639083862},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5390097498893738},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5067256093025208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4960857331752777},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4670713543891907},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.4523313343524933},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4356117248535156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3258931636810303},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3185878396034241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19406002759933472},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18986880779266357},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09614598751068115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7234522104263306},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6164921522140503},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6143860816955566},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5614219307899475},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5455597639083862},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5390097498893738},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5067256093025208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4960857331752777},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4670713543891907},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.4523313343524933},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4356117248535156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3258931636810303},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3185878396034241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19406002759933472},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18986880779266357},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09614598751068115},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2555559350","https://openalex.org/W2369989480","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1968750272","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"Switching":[0],"networks":[1,84],"with":[2],"probabilistic":[3,58],"traffic":[4],"are":[5],"positioned":[6],"prominently":[7],"in":[8,45],"communication":[9,34,106],"engineering.":[10],"Measures":[11],"of":[12,22,83,122,130],"performance":[13],"for":[14,28,80,95,99],"such":[15],"a":[16,57,81,92,105,119],"network":[17,24,54],"include":[18],"the":[19,23,26,29,53,65,96,123,128,131],"blocking":[20,40],"probability":[21],"and":[25,108],"time":[27,98,117],"routing":[30,47,66,78,101],"algorithm":[31,67,102,112],"to":[32,63,103],"establish":[33,104],"paths.":[35],"Although":[36],"literature":[37],"exists":[38],"concerning":[39],"probability,":[41],"little":[42],"theoretical":[43],"progress":[44],"efficient":[46],"algorithms":[48,79],"has":[49,114],"been":[50],"made.":[51],"Since":[52],"is":[55,61],"under":[56],"traffic,":[59],"it":[60],"meaningful":[62],"measure":[64],"by":[68],"its":[69],"expected":[70,97,116],"running":[71],"time.":[72],"In":[73],"this":[74],"paper,":[75],"we":[76],"consider":[77],"class":[82],"known":[85],"as":[86],"series-parallel":[87],"networks.":[88],"We":[89],"first":[90],"prove":[91],"lower":[93,124],"bound":[94],"any":[100],"path":[107],"then":[109],"present":[110],"an":[111,115],"that":[113],"within":[118],"constant":[120],"factor":[121],"bound,":[125],"thus":[126],"establishing":[127],"optimality":[129],"algorithm.":[132],"\u00a9":[133],"1996":[134],"John":[135],"Wiley":[136],"&":[137],"Sons,":[138],"Inc.":[139]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}