Design and evaluation of a wireless fair queueing algorithm with weighted-sacrificing policy

Sheng-Tzong Cheng, Ming Hung Tao

研究成果: Conference contribution

摘要

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS.In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limited-buffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematic analysis simulations.

原文English
主出版物標題Proceedings of the International Conference on Wireless Networks, ICWN'04 - Proceedings of the International Conference on Pervasive Computing and Communications, PCC'04
編輯H.R. Arabnia, L.T. Yang, C.-H. Yeh
頁面492-498
頁數7
2
出版狀態Published - 2004
事件Proceedings of the International Conference on Wireless Networks, ICWN'04 - Las Vegas, NV, United States
持續時間: 2004 六月 212004 六月 24

Other

OtherProceedings of the International Conference on Wireless Networks, ICWN'04
國家/地區United States
城市Las Vegas, NV
期間04-06-2104-06-24

All Science Journal Classification (ASJC) codes

  • 工程 (全部)

指紋

深入研究「Design and evaluation of a wireless fair queueing algorithm with weighted-sacrificing policy」主題。共同形成了獨特的指紋。

引用此