CDF-Based Scheduling Algorithm for Proportional Throughput Fairness
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ge, Xin | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Leung, Victor C. M. | - |
dc.date.accessioned | 2021-06-22T16:45:12Z | - |
dc.date.available | 2021-06-22T16:45:12Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2016-05 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/13716 | - |
dc.description.abstract | Cumulative distribution function (CDF)-based scheduling (CS) with resource-based fairness is well-known as an efficient algorithm that satisfies fair resource sharing among users while accommodating exploitation of multiuser diversity. In this letter, we extend CS to satisfy proportional throughput fairness. In particular, the proposed CS with proportional throughput fairness (CSPT) exploits the properties of CS to intelligently calculate the channel access ratio (CAR) for each user that satisfies proportional throughput fairness. Then, user selection is performed under CS with the obtained CARs. Moreover, the throughput upper-bound of schedulers satisfying proportional throughput fairness is analyzed and, through asymptotic analysis and simulations for various scenarios, we show that the performance of our proposed CSPT is close to this upper-bound. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | CDF-Based Scheduling Algorithm for Proportional Throughput Fairness | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jin, Hu | - |
dc.identifier.doi | 10.1109/LCOMM.2016.2544750 | - |
dc.identifier.scopusid | 2-s2.0-84969766957 | - |
dc.identifier.wosid | 000376516000050 | - |
dc.identifier.bibliographicCitation | IEEE COMMUNICATIONS LETTERS, v.20, no.5, pp.1034 - 1037 | - |
dc.relation.isPartOf | IEEE COMMUNICATIONS LETTERS | - |
dc.citation.title | IEEE COMMUNICATIONS LETTERS | - |
dc.citation.volume | 20 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1034 | - |
dc.citation.endPage | 1037 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | CDF-based scheduling | - |
dc.subject.keywordAuthor | multiuser diversity | - |
dc.subject.keywordAuthor | proportional fairness | - |
dc.subject.keywordAuthor | throughput fairness | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7438783 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.