{"id":"https://openalex.org/W2143556868","doi":"https://doi.org/10.1109/infcom.2009.5062088","title":"Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule","display_name":"Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2143556868","doi":"https://doi.org/10.1109/infcom.2009.5062088","mag":"2143556868"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5062088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-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/A5030024299","display_name":"Bashir Olaniyi Sadiq","orcid":"https://orcid.org/0000-0001-7868-4076"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Sadiq","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009631871","display_name":"Seung Jun Baek","orcid":"https://orcid.org/0000-0002-1226-0147"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"S. J. Baek","raw_affiliation_strings":["College of Information and Communication, Korea University, South Korea",", Korea University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information and Communication, Korea University, South Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":", Korea University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008917819","display_name":"Gustavo de Veciana","orcid":"https://orcid.org/0000-0002-1498-494X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. de Veciana","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.019,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9731477,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1692","last_page":"1700"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":1.0,"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"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.9972000122070312,"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/queue","display_name":"Queue","score":0.6937339901924133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6833573579788208},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6315754652023315},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6106749773025513},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6049275994300842},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.578549325466156},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5017833709716797},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4600484371185303},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45528823137283325},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4492255747318268},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.43427902460098267},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22220826148986816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22065815329551697},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.081065833568573}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6937339901924133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6833573579788208},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6315754652023315},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6106749773025513},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6049275994300842},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.578549325466156},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5017833709716797},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4600484371185303},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45528823137283325},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4492255747318268},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.43427902460098267},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22220826148986816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22065815329551697},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.081065833568573},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2009.5062088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1517625504","https://openalex.org/W1989225545","https://openalex.org/W2030611753","https://openalex.org/W2055959255","https://openalex.org/W2063787625","https://openalex.org/W2087294514","https://openalex.org/W2098432798","https://openalex.org/W2103468752","https://openalex.org/W2108327442","https://openalex.org/W2128510063","https://openalex.org/W2135663206","https://openalex.org/W2142798161","https://openalex.org/W2151171076","https://openalex.org/W2155277691","https://openalex.org/W4239181556","https://openalex.org/W6630745766"],"related_works":["https://openalex.org/W1489292980","https://openalex.org/W2795079910","https://openalex.org/W2951610245","https://openalex.org/W1430963189","https://openalex.org/W1974262772","https://openalex.org/W2049901819","https://openalex.org/W3037410748","https://openalex.org/W2052430123","https://openalex.org/W1983437306","https://openalex.org/W4387778523"],"abstract_inverted_index":{"This":[0,99],"paper":[1,207],"considers":[2],"the":[3,17,20,32,50,76,85,147,166,169,196,216,229,246,255,267,270,280,288,299,314],"design":[4,232],"of":[5,23,52,87,92,122,144,168,194,199,219],"opportunistic":[6,235],"packet":[7,180],"schedulers":[8],"for":[9,26,161,234,294,304,321],"users":[10,238,251],"sharing":[11],"a":[12,27,74,81,141,205,284],"time-varying":[13],"wireless":[14,163,305],"channel":[15,41],"from":[16],"performance":[18,134],"and":[19,40,48,110,135,155,324],"robustness":[21,136],"points":[22],"view.":[24],"Firstly,":[25],"simplified":[28],"model":[29],"falling":[30],"in":[31,80,90,101,118,178,192,204,287],"classical":[33],"Markov":[34],"decision":[35],"process":[36],"framework":[37],"where":[38,307],"arrival":[39],"statistics":[42,124],"are":[43,116,151],"known,":[44],"we":[45,139,208,223,242],"numerically":[46],"compute":[47],"evaluate":[49],"characteristics":[51],"mean-delay-optimal":[53],"scheduling":[54],"policies.":[55],"The":[56,113],"computed":[57],"policies":[58],"exhibit":[59],"radial":[60,152],"sum-rate":[61,153],"monotonicity":[62],"(RSM),":[63],"i.e.,":[64],"when":[65],"users'":[66],"queues":[67,89],"grow":[68],"linearly":[69],"(i.e.":[70],"scaled":[71],"up":[72,174],"by":[73],"constant),":[75],"scheduler":[77],"allocates":[78],"service":[79],"manner":[82],"that":[83,119,150,187,211,244,261,303],"de-emphasizes":[84],"balancing":[86],"unequal":[88],"favor":[91],"maximizing":[93],"current":[94],"system":[95],"throughput":[96,157],"(being":[97],"opportunistic).":[98],"is":[100,190,311],"sharp":[102],"contrast":[103],"to":[104,175,227,266,327],"previously":[105],"proposed":[106],"policies,":[107,145],"e.g.,":[108],"MaxWeight":[109],"Exp":[111,188,271],"rule.":[112],"latter,":[114],"however,":[115],"throughput-optimal,":[117],"without":[120],"knowledge":[121],"arrival/channel":[123],"they":[125],"achieve":[126,273],"stability":[127],"if":[128,263,296],"at":[129],"all":[130],"feasible.":[131],"To":[132],"meet":[133],"objectives,":[137],"secondly,":[138],"propose":[140],"new":[142],"class":[143],"called":[146],"Log":[148,170,281,315],"rule,":[149],"monotone":[154],"provably":[156],"optimal.":[158],"Our":[159,258],"simulations":[160,226,259],"realistic":[162],"channels":[164],"confirm":[165],"superiority":[167],"rule":[171,189,272,282,316],"which":[172],"achieves":[173,283],"80%":[176],"reduction":[177,286],"mean":[179],"delays.":[181],"However,":[182],"recent":[183],"asymptotic":[184,197,217,248],"analysis":[185],"showed":[186],"optimal":[191],"terms":[193],"minimizing":[195,245],"probability":[198,218],"max-queue":[200],"overflow.":[201,221],"In":[202],"turn,":[203],"companion":[206],"have":[209],"shown":[210],"an":[212],"RSM":[213],"policy":[214],"minimizes":[215],"sum-queue":[220],"Finally,":[222],"use":[224],"extensive":[225],"explore":[228],"various":[230],"possible":[231],"objectives":[233],"schedulers.":[236],"When":[237],"see":[239],"heterogenous":[240],"channels,":[241],"find":[243],"worst":[247],"exponent":[249],"across":[250,277],"may":[252,317],"excessively":[253],"compromise":[254],"overall":[256],"delay.":[257],"show":[260],"only":[262],"perfectly":[264],"tuned":[265],"load":[268],"will":[269],"low":[274],"homogenous":[275],"tails":[276],"users.":[278,300],"Otherwise":[279],"20-75%":[285],"99":[289],"<sup":[290],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[291],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">th</sup>":[292],"percentile":[293],"most,":[295],"not":[297],"all,":[298],"We":[301],"conclude":[302],"environments,":[306],"precise":[308],"resource":[309],"allocation":[310],"virtually":[312],"impossible,":[313],"be":[318],"more":[319],"desirable":[320],"its":[322],"robust":[323],"graceful":[325],"degradation":[326],"unpredicted":[328],"changes.":[329]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}