Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks(Wireless Communication Technologies)
スポンサーリンク
概要
- 論文の詳細を見る
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 mathematical analysis and simulations.
- 社団法人電子情報通信学会の論文
- 2005-04-01
著者
-
Tao Ming
Department Of Computer Science And Information Engineering National Cheng Kung University
-
Cheng Sheng
Department Of Electrical Engineering National Chung-hsing University
-
Cheng Sheng
Department Of Computer Science And Information Engineering National Cheng Kung University
関連論文
- Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks(Wireless Communication Technologies)
- Smart Antennas for Multiuser DS/CDMA Communications in Multipath Fading Channels(Wireless Communication Technologies)
- An Integrated Location Management Scheme for Seamless Access in B3G Systems(Terrestrial Radio Communications)