Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
A
minimum
-Bandwidth Guaranteed Scheduling Algorithm for Data Services in CDMA/HDR System
| |
|
A minimum-Bandwidth Guaranteed Scheduling Algorithm for Data Services in CDMA/HDR System
Seong-il Hahm6 , Hee-jin Lee6 and Jong-won Lee7 
| (6) |
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, 151-742, Republic of Korea |
| (7) |
School of Computer Science and Electrical Engineering, Handong Global University, Pohang, 791-708, Republic of Korea |
Abstract
CDMA/HDR system is designed to provide High Data Rate services in the cellular networks compatible with IS-95B CDMA network.
It uses a PF(Proportional Fairness) scheduler that improves total throughput by using multi-user diversity in a forward link
while supporting user’s average throughput proportional to channel conditions. Therefore, PFS does not guarantee the minimum
data rate to the users with poor channel conditions. We propose a new scheduling algorithm, which bounds the throughput ratio(RminRmax) between the best-channel user and the worst-channel user and maximizes the total throughput. Thus, it can guarantees minimum
bandwidth by adapting the throughput ratio(RminRmax). Furthermore, if the user data in the queue is less than the accommodation size of the assigned slot, there will be a loss
of efficiency. We add a function to the scheduler to protect the system from this performance degradation.
This work was supported by the University ITRe search Supporting Program under the Ministry of Information and Communication
of Korea, and the Basic Research Program of the Korea Science and Engineering Foundation.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|