基于ofdma下行网络的分组qos增强型比例公平调度算法

I. Chao, Chuei-Sheng Chiou, Kai-Shan Hsu
{"title":"基于ofdma下行网络的分组qos增强型比例公平调度算法","authors":"I. Chao, Chuei-Sheng Chiou, Kai-Shan Hsu","doi":"10.1109/ISNE.2015.7131958","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a Group-Oriented QoS-Enhanced proportional fair (GQPF) scheduling algorithm, which aiEnhanced proportional fair (GQPF) scheduling algorithm, which aims at maximizingms at maximizing QoS throughput while still retaining fairness as well as maximizing system throughput in downlink OFDMA networks. GQPF proposes a Group-Oriented QoS-enhanced PF-based utility function for multi-channel OFDMA networks. We demonstrate via extensive simulation results, that GQPF outperforms PF in terms of system throughput and mean delay. The results show that GQPF well accommodates nearly twice the amount of high priority data than PF does.","PeriodicalId":152001,"journal":{"name":"2015 International Symposium on Next-Generation Electronics (ISNE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A group-oriented QoS-enhanced proportional fair scheduling algorithm over downlink OFDMA-based networks\",\"authors\":\"I. Chao, Chuei-Sheng Chiou, Kai-Shan Hsu\",\"doi\":\"10.1109/ISNE.2015.7131958\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a Group-Oriented QoS-Enhanced proportional fair (GQPF) scheduling algorithm, which aiEnhanced proportional fair (GQPF) scheduling algorithm, which aims at maximizingms at maximizing QoS throughput while still retaining fairness as well as maximizing system throughput in downlink OFDMA networks. GQPF proposes a Group-Oriented QoS-enhanced PF-based utility function for multi-channel OFDMA networks. We demonstrate via extensive simulation results, that GQPF outperforms PF in terms of system throughput and mean delay. The results show that GQPF well accommodates nearly twice the amount of high priority data than PF does.\",\"PeriodicalId\":152001,\"journal\":{\"name\":\"2015 International Symposium on Next-Generation Electronics (ISNE)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Symposium on Next-Generation Electronics (ISNE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISNE.2015.7131958\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Next-Generation Electronics (ISNE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNE.2015.7131958","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种面向组的QoS- enhanced proportional fair (GQPF)调度算法,该算法旨在最大限度地提高QoS吞吐量,同时保持公平性和最大限度地提高下行OFDMA网络的系统吞吐量。GQPF为多信道OFDMA网络提出了一种面向群的qos增强的基于pf的实用函数。我们通过广泛的仿真结果证明,GQPF在系统吞吐量和平均延迟方面优于PF。结果表明,GQPF可以容纳的高优先级数据量几乎是PF的两倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A group-oriented QoS-enhanced proportional fair scheduling algorithm over downlink OFDMA-based networks
In this paper, we propose a Group-Oriented QoS-Enhanced proportional fair (GQPF) scheduling algorithm, which aiEnhanced proportional fair (GQPF) scheduling algorithm, which aims at maximizingms at maximizing QoS throughput while still retaining fairness as well as maximizing system throughput in downlink OFDMA networks. GQPF proposes a Group-Oriented QoS-enhanced PF-based utility function for multi-channel OFDMA networks. We demonstrate via extensive simulation results, that GQPF outperforms PF in terms of system throughput and mean delay. The results show that GQPF well accommodates nearly twice the amount of high priority data than PF does.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信