A fair guaranteed down-link sharing scheme for cellular packet switched networks

Kang, M.S.; Wilbur, Steve

doi:10.1109/glocom.1997.638479

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in RR scheme, it is equal probability and in CBO scheme, the closest (to BS) user has full probability. A user that is not scheduled will not be included in the calculation in (18).…”

Section: System Throughputmentioning

confidence: 99%

See 1 more Smart Citation

A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks

Zhao

Anpalagan

2008

Wireless Pers Commun

View full text Add to dashboard Cite

High speed data transmission in wireless networks demands better radio resource management schemes. A fair packet scheduling is proposed for downlinks of a cellular TD-CDMA system for delay-tolerant applications. It is based on the combined consideration of channel conditions, required throughput and achieved average throughput. A system dependent parameter is introduced to control the maximum achievable date rate as well as the degree of fairness. Through analysis and simulation, we study the tradeoff between system throughout (i.e., efficiency) and individual throughput (i.e., fairness). The relative performance between the proposed scheme and the traditional schemes is evaluated through simulation to confirm the analytical observations. The sensitivity of the system tolerance factor towards efficiency and fairness is also investigated.

show abstract

Section: System Throughputmentioning

confidence: 99%

“…A scheduler at a base station (BS) determines the next terminal to be served based on the reported data rate requests from the terminals and the amount of data that has already been transmitted to each terminal. The proposals in [17] and in [18] permit the adjustment of requested rate per MT based on the real-time channel quality.…”

Section: Introductionmentioning

confidence: 99%

A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks

Zhao

Anpalagan

2008

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Recently, much research has been done on devising new algorithms for fair queueing in wireless networks. A myriad of algorithms have been proposed [1], [3], [5], [6], [8], [9], [10], [11], [12], [13], [14]. The general idea of wireless scheduling algorithms is as follow: the scheduler simulates an error-free system running a wireline packet scheduling algorithm when the sessions have good (or perfect) channel states (effective throughput is maximum).…”

Section: B Fairness Notions For Wireless Networkmentioning

confidence: 99%

Channel capacity fair queueing in wireless networks: issues and a new algorithm

Wang¹,

Kwok²,

Lau³

et al.

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)

View full text Add to dashboard Cite

Wireless fair queueing algorithms have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified-a two states (good or bad) channel is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors are time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two sessions. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone sessions.

show abstract

Efficient Packet Scheduling Using Channel Adaptive Fair Queueing in Distributed Mobile Computing Systems

Wang

Kwok

Lau

et al. 2004

Mobile Networks and Applications

View full text Add to dashboard Cite

A fair guaranteed down-link sharing scheme for cellular packet switched networks

Cited by 6 publications

References 15 publications

A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks

A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks

Channel capacity fair queueing in wireless networks: issues and a new algorithm

Efficient Packet Scheduling Using Channel Adaptive Fair Queueing in Distributed Mobile Computing Systems

Contact Info

Product

Resources

About