{"id":"https://openalex.org/W2116033698","doi":"https://doi.org/10.1109/lcomm.2006.1638616","title":"Proportional fairness in multi-carrier system: upper bound and approximation algorithms","display_name":"Proportional fairness in multi-carrier system: upper bound and approximation algorithms","publication_year":2006,"publication_date":"2006-06-01","ids":{"openalex":"https://openalex.org/W2116033698","doi":"https://doi.org/10.1109/lcomm.2006.1638616","mag":"2116033698"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2006.1638616","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2006.1638616","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","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/A5034520384","display_name":"Megumi Kaneko","orcid":"https://orcid.org/0000-0003-4943-4769"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"M. Kaneko","raw_affiliation_strings":["Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","[Dept. of Commun. Technol., Aalborg Univ.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"[Dept. of Commun. Technol., Aalborg Univ.]","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071289803","display_name":"Petar Popovski","orcid":"https://orcid.org/0000-0001-6195-4797"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"P. Popovski","raw_affiliation_strings":["Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","[Dept. of Commun. Technol., Aalborg Univ.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"[Dept. of Commun. Technol., Aalborg Univ.]","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014398090","display_name":"Joachim Dahl","orcid":"https://orcid.org/0000-0002-5656-7909"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J. Dahl","raw_affiliation_strings":["Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","[Dept. of Commun. Technol., Aalborg Univ.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for TeleInFrastruktur, CTIF, Department of Communication Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"[Dept. of Commun. Technol., Aalborg Univ.]","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":3.0325,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.91170938,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"6","first_page":"462","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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":0.9998999834060669,"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.9912999868392944,"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.9843000173568726,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6771382093429565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6478051543235779},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5732319355010986},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5373581647872925},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5300785303115845},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.44047820568084717},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4321029484272003},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.424513578414917},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41902121901512146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3868476152420044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2816922664642334},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.1613856554031372},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.15640592575073242},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.121969074010849},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08987045288085938},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.08612677454948425},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07936668395996094}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6771382093429565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478051543235779},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5732319355010986},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5373581647872925},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5300785303115845},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.44047820568084717},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4321029484272003},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.424513578414917},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41902121901512146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3868476152420044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2816922664642334},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.1613856554031372},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.15640592575073242},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.121969074010849},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08987045288085938},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.08612677454948425},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07936668395996094},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcomm.2006.1638616","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2006.1638616","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/682efbc0-a165-11db-8ed6-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/682efbc0-a165-11db-8ed6-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kaneko , M , Popovski , P & Dahl , J 2006 , ' Proportional Fairness in Multi-Carrier System: Upper Bound and Approximation Algorithms ' , IEEE Communications Letters , vol. 10 , no. 6 , pp. 462-464 . https://doi.org/10.1109/LCOMM.2006.1638616","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1531411251","https://openalex.org/W1985123706","https://openalex.org/W2104057862","https://openalex.org/W2134845634","https://openalex.org/W2156717031","https://openalex.org/W2161872841","https://openalex.org/W2166196983","https://openalex.org/W2296319761","https://openalex.org/W4239651601","https://openalex.org/W4250589301","https://openalex.org/W6631643357","https://openalex.org/W6682942402"],"related_works":["https://openalex.org/W2076773727","https://openalex.org/W2132850534","https://openalex.org/W1605983382","https://openalex.org/W1999684000","https://openalex.org/W2164442311","https://openalex.org/W4252664386","https://openalex.org/W1968173952","https://openalex.org/W2349070714","https://openalex.org/W1977807590","https://openalex.org/W1534183152"],"abstract_inverted_index":{"The":[0,45,55],"solution":[1],"for":[2],"the":[3,25,32],"optimal":[4],"multi-carrier":[5],"(MC)":[6],"proportional":[7,27],"fair":[8],"scheduling":[9],"(PFS)":[10],"is":[11,48],"prohibitively":[12],"complex":[13],"to":[14],"obtain.":[15],"In":[16],"this":[17],"letter":[18],"we":[19],"obtain":[20],"an":[21],"upper":[22],"bound":[23],"on":[24],"achievable":[26],"fairness":[28],"(PF)":[29],"performance":[30],"in":[31],"case":[33],"of":[34],"finite":[35],"PFS":[36],"window":[37],"size.":[38],"Next,":[39],"three":[40],"approximation":[41],"algorithms":[42],"are":[43],"proposed.":[44],"first":[46],"one":[47],"computationally":[49],"complex,":[50],"but":[51],"achieves":[52],"near-optimal":[53],"PF.":[54],"two":[56],"others":[57],"achieve":[58],"a":[59],"good":[60],"tradeoff":[61],"between":[62],"throughput":[63],"and":[64],"PF":[65],"with":[66],"low":[67],"complexity":[68]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}