State-dependent proportional fair scheduling algorithms for wireless forward link data services

研究成果: 書貢獻/報告類型會議論文篇章

6 引文 斯高帕斯(Scopus)

摘要

For wireless forward link data services, the proportional fair algorithm (PFA) incorporating opportunistic scheduling was originally designed to maintain service fairness among users as well as to exploit channel fluctuations in fading environments. The operation of PFA necessitates throughput monitoring for each user, in general through exponentially smoothing received services. In the paper, we adapt the PFA for use in more generic traffic conditions where the number of active users may change with time and data for a user may arrive intermittently. Our approach is not only to simply stop throughput monitoring for idle users but also to further accommodate in throughput monitoring changes in the number of active users. Moreover, we use in throughput monitoring different smoothing factors depending on the state of backlogged data loads, in order to exploit the variation of multiuser diversity gain. Consequently, our PFA, taking into account both channel state and system queue fluctuations, presents several favorable performance features.

原文英語
主出版物標題INFOCOM 2008
主出版物子標題27th IEEE Communications Society Conference on Computer Communications
頁面331-335
頁數5
DOIs
出版狀態已發佈 - 2008 九月 15
事件INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, 美国
持續時間: 2008 四月 132008 四月 18

出版系列

名字Proceedings - IEEE INFOCOM
ISSN(列印)0743-166X

其他

其他INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
國家/地區美国
城市Phoenix, AZ
期間2008/04/132008/04/18

ASJC Scopus subject areas

  • 電腦科學(全部)
  • 電氣與電子工程

指紋

深入研究「State-dependent proportional fair scheduling algorithms for wireless forward link data services」主題。共同形成了獨特的指紋。

引用此