{"id":"https://openalex.org/W1525313602","doi":"https://doi.org/10.1109/pimrc.2005.1651755","title":"Opportunistic Scheduling for utility maximization under QoS constraints","display_name":"Opportunistic Scheduling for utility maximization under QoS constraints","publication_year":2006,"publication_date":"2006-08-03","ids":{"openalex":"https://openalex.org/W1525313602","doi":"https://doi.org/10.1109/pimrc.2005.1651755","mag":"1525313602"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2005.1651755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2005.1651755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","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/A5028656478","display_name":"Neung-Hyung Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Neung-Hyung Lee","raw_affiliation_strings":["School of Electrical Engineering & Computer Science, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering & Computer Science, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012483680","display_name":"Jin\u2010Ghoo Choi","orcid":"https://orcid.org/0000-0002-7186-2156"},"institutions":[{"id":"https://openalex.org/I4210165268","display_name":"Korea Testing Laboratory","ror":"https://ror.org/05aykjy67","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210165268"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jin-Ghoo Choi","raw_affiliation_strings":["KT Convergence Laboratory, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"KT Convergence Laboratory, Seoul, Korea","institution_ids":["https://openalex.org/I4210165268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006997436","display_name":"Saewoong Bahk","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Saewoong Bahk","raw_affiliation_strings":["School of Electrical Engineering & Computer Science, Seoul National University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering & Computer Science, Seoul National University, Seoul, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028656478"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.03565538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"1818","last_page":"1822"},"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.9983000159263611,"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.9882000088691711,"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.8229187726974487},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6827001571655273},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6603156924247742},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5959603786468506},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.579574704170227},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5353966355323792},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5160200595855713},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5134690403938293},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.49783825874328613},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.4758602976799011},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4607241451740265},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4517230689525604},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4306766986846924},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39314109086990356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06835129857063293}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8229187726974487},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6827001571655273},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6603156924247742},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5959603786468506},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.579574704170227},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5353966355323792},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5160200595855713},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5134690403938293},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.49783825874328613},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4758602976799011},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4607241451740265},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4517230689525604},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4306766986846924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39314109086990356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06835129857063293}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc.2005.1651755","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2005.1651755","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1517625504","https://openalex.org/W1987497363","https://openalex.org/W2087294514","https://openalex.org/W2149375806","https://openalex.org/W2161872841","https://openalex.org/W2531891978","https://openalex.org/W4239651601","https://openalex.org/W4302033506","https://openalex.org/W6630745766"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2093454713","https://openalex.org/W1999684000","https://openalex.org/W2225350526","https://openalex.org/W3151407988","https://openalex.org/W2117584696","https://openalex.org/W2071937864","https://openalex.org/W2129448549","https://openalex.org/W2359535379","https://openalex.org/W2356538771"],"abstract_inverted_index":{"Opportunistic":[0],"scheduling":[1,27,51,70,101],"provides":[2],"an":[3,48],"important":[4],"capability":[5],"of":[6,15,40],"resource":[7],"management":[8],"for":[9,76,117],"wireless":[10],"systems":[11],"by":[12,53,72],"taking":[13],"advantage":[14],"multiuser":[16],"diversity,":[17],"allowing":[18],"delay":[19],"variation":[20],"in":[21,64,146],"delivering":[22],"data":[23],"packets.":[24],"Our":[25],"opportunistic":[26,65,84,132],"aims":[28],"at":[29],"maximizing":[30],"the":[31,59,69,103],"utility":[32],"which":[33],"is":[34,61],"usually":[35],"expressed":[36],"as":[37],"a":[38,114],"function":[39],"user":[41],"throughput.":[42],"In":[43],"this":[44],"paper":[45],"we":[46,82,112],"derive":[47],"off-line":[49],"optimal":[50,63,100],"policy":[52,60,71],"optimization":[54],"theory,":[55],"and":[56,120,138],"show":[57,134],"that":[58,129],"also":[62,93],"scheduling.":[66],"We":[67],"extend":[68],"adding":[73],"QoS":[74,88,107,142],"requirements":[75],"each":[77,140],"user.":[78],"To":[79,98],"do":[80],"so,":[81],"classify":[83],"schedulers":[85,133],"according":[86],"to":[87,106],"constraints.":[89],"Their":[90],"optimalities":[91],"are":[92],"proved":[94],"through":[95,124],"mathematical":[96],"analysis.":[97],"obtain":[99],"policy,":[102],"parameters":[104],"related":[105],"should":[108],"be":[109],"computed,":[110],"so":[111],"propose":[113],"practical":[115],"algorithm":[116],"parameter":[118],"adaptation":[119],"verify":[121],"its":[122],"performance":[123,137],"simulations.":[125],"The":[126],"results":[127],"confirm":[128],"our":[130],"considered":[131],"good":[135],"fairness":[136],"guarantee":[139],"user's":[141],"without":[143],"any":[144],"difficulty":[145],"implementation.":[147]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}