{"id":"https://openalex.org/W2085271720","doi":"https://doi.org/10.1145/1140086.1140090","title":"Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up","display_name":"Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up","publication_year":2006,"publication_date":"2006-07-05","ids":{"openalex":"https://openalex.org/W2085271720","doi":"https://doi.org/10.1145/1140086.1140090","mag":"2085271720"},"language":"en","primary_location":{"id":"doi:10.1145/1140086.1140090","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1140086.1140090","pdf_url":null,"source":{"id":"https://openalex.org/S66039016","display_name":"ACM SIGCOMM Computer Communication Review","issn_l":"0146-4833","issn":["0146-4833","1943-5819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCOMM Computer Communication Review","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/A5024581400","display_name":"Claus Bauer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093996","display_name":"Dolby (United States)","ror":"https://ror.org/01eyenr26","country_code":"US","type":"company","lineage":["https://openalex.org/I4210093996"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Claus Bauer","raw_affiliation_strings":["Dolby Laboratories, San Francisco, CA","[Dolby Laboratories, San Francisco, CA]"],"affiliations":[{"raw_affiliation_string":"Dolby Laboratories, San Francisco, CA","institution_ids":["https://openalex.org/I4210093996"]},{"raw_affiliation_string":"[Dolby Laboratories, San Francisco, CA]","institution_ids":["https://openalex.org/I4210093996"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024581400"],"corresponding_institution_ids":["https://openalex.org/I4210093996"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.168486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"3","first_page":"15","last_page":"26"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9919000267982483,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9908000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8376525640487671},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7121648788452148},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6410950422286987},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.527686357498169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5147411823272705},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47969862818717957},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42548495531082153},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2179861068725586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20088142156600952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09620708227157593}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8376525640487671},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7121648788452148},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6410950422286987},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.527686357498169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5147411823272705},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47969862818717957},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42548495531082153},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2179861068725586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20088142156600952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09620708227157593},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1140086.1140090","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1140086.1140090","pdf_url":null,"source":{"id":"https://openalex.org/S66039016","display_name":"ACM SIGCOMM Computer Communication Review","issn_l":"0146-4833","issn":["0146-4833","1943-5819"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGCOMM Computer Communication Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.2464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.2464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ccr.sigcomm.org/online/files/p17-v36n3d-bauer.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/32328","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/32328","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1140086.1140090","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":16,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1869723204","https://openalex.org/W1910846960","https://openalex.org/W2003346154","https://openalex.org/W2024607148","https://openalex.org/W2028468530","https://openalex.org/W2054420170","https://openalex.org/W2091299439","https://openalex.org/W2122857537","https://openalex.org/W2125353864","https://openalex.org/W2129733562","https://openalex.org/W2131298387","https://openalex.org/W2140058931","https://openalex.org/W2145371366","https://openalex.org/W2149223885","https://openalex.org/W2151125914"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W2365647353","https://openalex.org/W2794488505","https://openalex.org/W4301594054","https://openalex.org/W3125889879","https://openalex.org/W4385401023","https://openalex.org/W2044363610","https://openalex.org/W3124422538","https://openalex.org/W2295467472","https://openalex.org/W1597107533"],"abstract_inverted_index":{"The":[0],"delay":[1],"and":[2,15],"throughput":[3],"characteristics":[4],"of":[5,48,81,94,104,129,158,173,198,225,251],"a":[6,79,87,92,121,138,156,160,171,199,245],"packet":[7],"switch":[8,182],"depend":[9],"mainly":[10,29],"on":[11,25,31,166,191],"the":[12,16,21,46,64,102,127,145,196,234],"queueing":[13],"scheme":[14],"scheduling":[17,26,35,114,192,207,220],"algorithm":[18,147],"deployed":[19,77,136,154],"at":[20],"switch.":[22],"Early":[23],"research":[24,61,187],"algorithms":[27,44,69,106,112,177,193,208,221,236],"has":[28,188,204],"focused":[30,190],"maximum":[32,41,109],"weight":[33,42,110,175],"matching":[34,43,68,105,111,176],"algorithms.":[36],"It":[37],"is":[38,96,153],"known":[39],"that":[40,63,107,118,144,178,194,222,233],"guarantee":[45,126,195],"stability":[47,128,197],"input-queued":[49,72,149,181,226,252],"switches,":[50],"but":[51,248],"are":[52,76,135],"impractical":[53],"due":[54],"to":[55,113,217],"their":[56],"high":[57,88],"computational":[58,89,123],"complexity.":[59],"Later":[60],"showed":[62],"less":[65],"complex":[66],"maximal":[67,174],"can":[70,212],"stabilize":[71,179,223,244],"switches":[73,132,150,211],"when":[74,133,151],"they":[75,125,134],"with":[78,137,155],"speed-up":[80,93,157],"two.":[82],"For":[83],"practical":[84],"purposes,":[85],"neither":[86],"complexity":[90],"nor":[91],"two":[95],"desirable.In":[97],"this":[98,239],"paper,":[99],"we":[100,142,163,231],"investigate":[101],"application":[103],"approximate":[108],"problems.":[115],"We":[116],"show":[117,143,232],"while":[119],"having":[120],"low":[122],"complexity,":[124],"input":[130],"queued":[131],"moderate":[139],"speed-up.In":[140],"particular,":[141],"improve_matching":[146],"stabilizes":[148],"it":[152],"3<over>2+\u03b5.In":[159],"second":[161],"step,":[162],"further":[164],"improve":[165],"these":[167],"results":[168],"by":[169],"proposing":[170],"class":[172],"an":[180],"without":[183],"any":[184],"speed-up.Whereas":[185],"initial":[186],"only":[189,243],"single":[200,210,246],"switch,":[201,247],"recent":[202],"work":[203],"shown":[205],"how":[206],"for":[209],"be":[213],"modified":[214],"in":[215,238],"order":[216],"design":[218],"distributed":[219],"networks":[224,250],"switches.":[227,253],"Using":[228],"those":[229],"results,":[230],"switching":[235],"proposed":[237],"paper":[240],"do":[241],"not":[242],"also":[249]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}