The full text of this article
Robust scheduling algorithm for guaranteed bit rate services
by Huda Adibah Mohd Ramli; Kumbesan Sandrasegaran
International Journal of Mobile Communications (IJMC), Vol. 11, No. 1, 2013
Abstract: This paper proposes a novel packet scheduling algorithm to overcome detrimental effects of channel impairments on the quality of service of delay-sensitive Guaranteed Bit Rate (GBR) services. The proposed algorithm prioritises the packets that require retransmission of Hybrid Automatic Repeat Request (HARQ) users compared to the packets of new users. The packets of new users are scheduled according to the Channel Quality Information (CQI), average throughput and packet delay information. Computer simulations have demonstrated that the proposed algorithm has 22.7% system capacity improvement over a well-known algorithm. It also tolerates for up to 200% delay of CQI and reduces the uplink signalling overhead by 150% compared to the well-known algorithm without compromising the quality of service requirements of the GBR services.
is only available to individual subscribers or to users at subscribing institutions.
Go to Inderscience Online Journals to access the Full Text of this article.
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable).
See our Orders page to subscribe.
If you still need assistance, please email email@example.com