{"id":"https://openalex.org/W2049917077","doi":"https://doi.org/10.1137/s009753970343275x","title":"Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control","display_name":"Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2049917077","doi":"https://doi.org/10.1137/s009753970343275x","mag":"2049917077"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970343275x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970343275x","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/A5019462315","display_name":"Panagiota Fatourou","orcid":"https://orcid.org/0000-0002-6265-6895"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Panagiota Fatourou","raw_affiliation_strings":["Department of Computer Science, University of Ioannina, P.O. Box 1186, Ioannina GR-45110, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ioannina, P.O. Box 1186, Ioannina GR-45110, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066537602","display_name":"Marios Mavronicolas","orcid":"https://orcid.org/0009-0009-0115-3045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marios Mavronicolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Computer Technology Institute and Press \u201cDIOPHANTUS\u201d","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]},{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY","GR"],"is_corresponding":false,"raw_author_name":"Paul Spirakis","raw_affiliation_strings":["Department of Computer Science, University of Cyprus, P.O. Box 20537, Nicosia CY-1678, Cyprus","Department of Computer Engineering and Informatics, University of Patras, Rion, Patras GR-26500, Greece, and Research and Academic Computer Technology Institute, P.O. Box 1122, Patras GR-26110, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Cyprus, P.O. Box 20537, Nicosia CY-1678, Cyprus","institution_ids":["https://openalex.org/I34771391"]},{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Rion, Patras GR-26500, Greece, and Research and Academic Computer Technology Institute, P.O. Box 1122, Patras GR-26110, Greece","institution_ids":["https://openalex.org/I120729142","https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2739,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65898368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"34","issue":"5","first_page":"1216","last_page":"1252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"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.998199999332428,"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.9980000257492065,"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/bottleneck","display_name":"Bottleneck","score":0.692674458026886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6742974519729614},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6469153761863708},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6394485235214233},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5300371646881104},{"id":"https://openalex.org/keywords/session","display_name":"Session (web analytics)","score":0.4885631501674652},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4179520308971405},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4174152612686157},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39919939637184143},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.333462119102478},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19658705592155457}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.692674458026886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6742974519729614},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6469153761863708},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6394485235214233},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5300371646881104},{"id":"https://openalex.org/C2779182362","wikidata":"https://www.wikidata.org/wiki/Q17126187","display_name":"Session (web analytics)","level":2,"score":0.4885631501674652},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4179520308971405},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4174152612686157},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39919939637184143},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.333462119102478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19658705592155457},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s009753970343275x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970343275x","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.8040","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.8040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.cs.ucy.ac.cy/~mavronic/pdf/oblivious.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.8361","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~faturu/papers/flow.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.1976","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.yorku.ca/~jeff/research/tcp/others/fatourou.pdf","raw_type":"text"},{"id":"mag:3173925298","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=200902129483149756","pdf_url":null,"source":{"id":"https://openalex.org/S4306420730","display_name":"Principles of Distributed Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":"Principles of Distributed Computing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6281229250","display_name":null,"funder_award_id":"001907","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6577941289","display_name":null,"funder_award_id":"IST-1999-14186","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8324044844","display_name":null,"funder_award_id":"IST-2001-33116","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320313981","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1512056429","https://openalex.org/W1583319144","https://openalex.org/W1603124920","https://openalex.org/W1603273291","https://openalex.org/W1980375431","https://openalex.org/W1989723649","https://openalex.org/W1992674660","https://openalex.org/W2013034279","https://openalex.org/W2035401650","https://openalex.org/W2039062850","https://openalex.org/W2056184462","https://openalex.org/W2105520014","https://openalex.org/W2108867573","https://openalex.org/W2112940483","https://openalex.org/W2123878303","https://openalex.org/W2128283555","https://openalex.org/W2130556831","https://openalex.org/W2164289502","https://openalex.org/W2613173048","https://openalex.org/W3023787733","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2374412966","https://openalex.org/W2357325779","https://openalex.org/W3087157779","https://openalex.org/W2576147416","https://openalex.org/W2112668038","https://openalex.org/W4306770904","https://openalex.org/W2122921656","https://openalex.org/W2965115007","https://openalex.org/W2049917077","https://openalex.org/W2510019121"],"abstract_inverted_index":{"Two":[0],"important":[1],"performance":[2],"parameters":[3],"of":[4,23,41,47,76,90,101,112,134,149,162,170,179,194,214,245,328,340],"distributed,":[5],"rate-based":[6,117,360],"flow":[7,118,361],"control":[8,119],"algorithms":[9,56,72,263,356],"are":[10,264,283],"their":[11,30],"locality":[12],"and":[13,103,186,260,309,342,346,354],"convergence":[14,107,168,219,297,337,348],"complexity.":[15],"The":[16],"former":[17],"is":[18,27,36,53,82,125,176,191,233,242,312],"characterized":[19],"by":[20,84,270],"the":[21,34,39,74,91,136,140,167,177,188,211,230,249,255,286,291],"amount":[22],"global":[24],"knowledge":[25],"that":[26,122,254,295],"available":[28,313],"to":[29,60,156,206,235,314],"scheduling":[31,129,231],"mechanisms,":[32],"while":[33],"latter":[35],"defined":[37],"as":[38],"number":[40,178,327],"update":[42,281,330],"operations":[43,282],"performed":[44,284],"on":[45,106,166,183,218],"rates":[46,138,308],"individual":[48],"sessions":[49,180],"until":[50],"max-min":[51,68],"fairness":[52],"reached.":[54],"Optimistic":[55],"allow":[57],"any":[58,171,224],"session":[59,78,137,189,239,307],"intermediately":[61],"receive":[62],"a":[63,77,85,98,145,150,158,184,192,202,318,335,347],"rate":[64,75],"larger":[65],"than":[66],"its":[67,128],"fair":[69],"rate;":[70],"bottleneck":[71,359],"finalize":[73],"only":[79],"if":[80,127,303],"it":[81],"restricted":[83],"certain,":[86],"highly":[87],"congested":[88],"link":[89],"network.":[92],"In":[93],"this":[94],"work,":[95],"we":[96,154,200,252,293],"present":[97,144,317],"comprehensive":[99],"collection":[100],"lower":[102,160,212,256],"upper":[104],"bounds":[105,257],"complexity,":[108],"under":[109],"varying":[110],"degrees":[111],"locality,":[113],"for":[114,223,258,357],"optimistic,":[115,358],"bottleneck,":[116],"algorithms.":[120],"Say":[121],"an":[123,325],"algorithm":[124],"oblivious":[126,172,226,259,262,273,341,344,353],"mechanism":[130,232],"uses":[131],"no":[132],"information":[133,237,304],"either":[135],"or":[139],"network":[141,246,310],"topology.":[142,247],"We":[143,267,316],"novel,":[146],"combinatorial":[147],"construction":[148],"capacitated":[151],"network,":[152,185],"which":[153,229,275,322],"use":[155,236],"establish":[157,207],"fundamental":[159],"bound":[161,213],"$\\frac{dn}{4}":[163,215],"+":[164,216,279],"\\frac{n}{2}$":[165,217,280],"complexity":[169,220,298,338,349],"algorithm,":[173,227,321],"where":[174],"n":[175,329],"laid":[181],"out":[182],"d,":[187],"dependency,":[190],"measure":[193],"topological":[195],"dependencies":[196],"among":[197],"sessions.":[198],"Moreover,":[199],"devise":[201],"novel":[203],"simulation":[204],"proof":[205],"that,":[208],"perhaps":[209],"surprisingly,":[210],"still":[221],"holds":[222],"partially":[225,261,343],"in":[228,285],"allowed":[234],"about":[238,305],"rates,":[240],"but":[241],"otherwise":[243],"unaware":[244],"On":[248],"positive":[250],"side,":[251],"prove":[253],"both":[265,306],"tight.":[266],"do":[268],"so":[269],"presenting":[271],"optimal":[272,326],"algorithms,":[274,345],"converge":[276],"after":[277],"$\\frac{dn}{2}":[278],"worst":[287],"case.":[288],"To":[289],"complete":[290],"picture,":[292],"show":[294],"linear":[296],"can":[299],"indeed":[300],"be":[301],"achieved":[302],"topology":[311],"schedulers.":[315],"counterexample,":[319],"nonoblivious":[320,355],"converges":[323],"within":[324],"operations.":[331],"Our":[332],"results":[333],"imply":[334],"surprising":[336],"collapse":[339],"separation":[350],"between":[351],"(partially)":[352],"control.":[362]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}