A fair scheduling algorithm with traffic classification for wireless networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1239 | en_US |
dc.citation.issue |
10 | en_US |
dc.citation.spage |
1225 | en_US |
dc.citation.volume |
28 | en_US |
dc.citation.woscount |
8 | |
dc.contributor.author |
Wang, YC | en_US |
dc.contributor.author |
Ye, SR | en_US |
dc.contributor.author |
Tseng, YC | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:18:52Z | |
dc.date.available |
2014-12-08T15:18:52Z | |
dc.date.issued |
2005-06-16 | en_US |
dc.description.abstract |
Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays may be incurred for real-time flows. To resolve this problem, we propose a traffic-dependent wireless fair queuing (TD-FQ) algorithm that takes traffic types of flows into consideration when scheduling packets. The proposed TD-FQ algorithm not only alleviates queuing delay of real-time flows, but also guarantees bounded delays and fairness for all flows. (c) 2004 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.comcom.2004.07.025 | en_US |
dc.identifier.issn |
0140-3664 | en_US |
dc.identifier.journal |
COMPUTER COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.comcom.2004.07.025 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/13575 | |
dc.identifier.wosnumber |
WOS:000229825800012 | |
dc.language.iso |
en_US | en_US |
dc.subject |
data communication | en_US |
dc.subject |
fair queuing | en_US |
dc.subject |
mobile communication system | en_US |
dc.subject |
scheduling | en_US |
dc.subject |
wireless network | en_US |
dc.title |
A fair scheduling algorithm with traffic classification for wireless networks | en_US |
dc.type |
Article | en_US |
檔案
- 000229825800012.pdf (498.5 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Wang, Y., Ye, S., & Tseng, Y. (2005). A fair scheduling algorithm with traffic classification for wireless networks. COMPUTER COMMUNICATIONS, 28(10), 1225–1239. https://doi.org/10.1016/j.comcom.2004.07.025
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13575