{"id":"https://openalex.org/W2124993162","doi":"https://doi.org/10.1109/glocom.2003.1258294","title":"Opportunistic scheduling policies for wireless systems with short term fairness constraints","display_name":"Opportunistic scheduling policies for wireless systems with short term fairness constraints","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2124993162","doi":"https://doi.org/10.1109/glocom.2003.1258294","mag":"2124993162"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5021149035","display_name":"Sunil Suresh Kulkarni","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.S. Kulkarni","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032643029","display_name":"Catherine Rosenberg","orcid":"https://orcid.org/0000-0002-1915-243X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Rosenberg","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Sch. of Electr. & Comput. engineering, Purdue Univ., West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":16.9602,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.99583709,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":null,"first_page":"533","last_page":"537"},"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.9980999827384949,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9970999956130981,"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.7867593765258789},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6590057611465454},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6528651714324951},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6395782232284546},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.6346268653869629},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6030792593955994},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.5905405282974243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5685673952102661},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5535045862197876},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5330653786659241},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5162127614021301},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4562488794326782},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42128676176071167},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.40192711353302},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3026534914970398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10356742143630981},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.10256010293960571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09807154536247253}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7867593765258789},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6590057611465454},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6528651714324951},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6395782232284546},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.6346268653869629},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6030792593955994},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.5905405282974243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5685673952102661},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5535045862197876},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5330653786659241},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5162127614021301},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4562488794326782},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42128676176071167},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.40192711353302},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3026534914970398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10356742143630981},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.10256010293960571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09807154536247253},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2003.1258294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.467.3947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.467.3947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.ece.uwaterloo.ca/~cath/Globecom03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1508623828","https://openalex.org/W1517625504","https://openalex.org/W1989225545","https://openalex.org/W2033129021","https://openalex.org/W2061476446","https://openalex.org/W2116748333","https://openalex.org/W2120086682","https://openalex.org/W2141979411","https://openalex.org/W2154717086","https://openalex.org/W4239651601","https://openalex.org/W6630745766","https://openalex.org/W6682576210"],"related_works":["https://openalex.org/W1999684000","https://openalex.org/W2184166483","https://openalex.org/W2117931771","https://openalex.org/W4300092030","https://openalex.org/W2393789493","https://openalex.org/W4386580182","https://openalex.org/W2383668729","https://openalex.org/W2060984508","https://openalex.org/W2071937864","https://openalex.org/W2356538771"],"abstract_inverted_index":{"We":[0,89,100,169,192],"consider":[1,101,112],"a":[2,155,178],"scheduling":[3,15,39,51,103,114,162,199],"problem":[4,52,63,84,95,104,115,163],"for":[5,27,96,116,158],"packet":[6],"based":[7],"wireless":[8,35],"systems":[9],"with":[10,53,105,164,201],"time-varying":[11,21],"channel":[12,22,134,143],"conditions.":[13,144],"Designing":[14],"mechanisms":[16,40],"that":[17,173,195],"take":[18],"advantage":[19],"of":[20,124,148],"conditions,":[23],"which":[24,73,129,139],"are":[25,41],"different":[26,28],"users,":[29],"is":[30,76,206],"necessary":[31],"to":[32,68],"improve":[33],"the":[34,69,74,92,102,113,117,146,149,196],"system":[36,190],"performance.":[37],"Such":[38],"called":[42],"opportunistic.":[43],"In":[44,78],"this":[45,83],"paper":[46],"we":[47,111,153],"formulate":[48],"an":[49,61],"opportunistic":[50,161,198],"short":[54,65,165,183],"term":[55,66,107,166,184,203],"processor":[56],"sharing":[57],"fairness":[58,75,108,167,185,204],"constraints":[59],"as":[60],"optimization":[62,94],"where":[64],"refers":[67],"time":[70],"window":[71,120],"on":[72],"guaranteed.":[77],"its":[79],"most":[80],"general":[81],"form,":[82],"cannot":[85],"be":[86],"solved":[87],"analytically.":[88],"first":[90],"solve":[91],"above":[93],"three":[97],"special":[98],"cases.":[99],"long":[106,202],"constraints;":[109],"then":[110],"shortest":[118],"possible":[119],"under":[121],"two":[122],"sets":[123],"assumptions":[125],"namely,":[126],"one":[127],"in":[128,138,207,210],"users":[130,140],"have":[131,141],"identically":[132],"distributed":[133],"conditions":[135],"and":[136],"another":[137],"independent":[142],"Observing":[145],"form":[147],"corresponding":[150],"optimal":[151,197],"policies,":[152],"define":[154],"heuristic":[156,175],"policy":[157,176,200],"our":[159,174],"original":[160],"constraints.":[168],"show":[170],"via":[171],"simulation":[172],"attains":[177],"good":[179],"trade-off":[180],"by":[181],"guaranteeing":[182],"while":[186],"achieving":[187],"high":[188],"average":[189],"throughput.":[191],"also":[193],"illustrate":[194],"constraint":[205],"fact":[208],"unfair":[209],"practical":[211],"scenarios.":[212]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}