PFQ-OS: A packet fair queueing based opportunistic scheduler in wireless networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wu Yu | - |
dc.contributor.author | Xi Yong | - |
dc.contributor.author | Kim Byungseo | - |
dc.contributor.author | Wei Jibo | - |
dc.date.accessioned | 2022-01-13T06:43:57Z | - |
dc.date.available | 2022-01-13T06:43:57Z | - |
dc.date.created | 2022-01-04 | - |
dc.date.issued | 2008-04 | - |
dc.identifier.issn | 1022-4653 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/22761 | - |
dc.description.abstract | In this paper, we investigate the issues of extending the Packet fair queueing (PFQ) algorithms into continuous channel model. We present a PFQ-based Opportunistic scheduler (PFQ-OS), which can improve user throughput while satisfying strict short-term fairness. We decouple the conflicting design objectives of fairness and user throughput improvement by introducing a Search radius (SR) into the framework of PFQ. We develop an analytical model and derive the fairness properties of PFQ-OS, which are related to the SR. Thereby system operators can focus on opportunistic scheduling for the users within the SR without violating the fairness guarantee. We further investigate the designing of scheduling policy under the strict fairness constraints, and propose that in order to utilize the opportunistic scheduling all the time, the selection rule should provide all the users with equal chance in being scheduled at each selection. Accordingly, we present Maximum relative SNR (Max-rSNR) selection rule for PFQ-OS. We derive the bounds in terms of user throughput under Rayleigh fading channel. An extensive set of simulations testifies our derived theoretical properties that PFQ-OS can significantly improve user throughput while providing excellent short-term fairness guarantee. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TECHNOLOGY EXCHANGE LIMITED HONG KONG | - |
dc.title | PFQ-OS: A packet fair queueing based opportunistic scheduler in wireless networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim Byungseo | - |
dc.identifier.scopusid | 2-s2.0-42249114667 | - |
dc.identifier.wosid | 000255103200031 | - |
dc.identifier.bibliographicCitation | CHINESE JOURNAL OF ELECTRONICS, v.17, no.2, pp.333 - 339 | - |
dc.relation.isPartOf | CHINESE JOURNAL OF ELECTRONICS | - |
dc.citation.title | CHINESE JOURNAL OF ELECTRONICS | - |
dc.citation.volume | 17 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 333 | - |
dc.citation.endPage | 339 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordAuthor | opportunistic scheduling | - |
dc.subject.keywordAuthor | fairness | - |
dc.subject.keywordAuthor | QoS (Quality of service) | - |
dc.subject.keywordAuthor | wireless networks | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK 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.