Robust scheduling algorithm for guaranteed bit rate services

Robust scheduling algorithm for guaranteed bit rate services

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 Reque...

Full description

Bibliographic Details
Main Authors: Mohd. Ramli, Huda Adibah, Sandrasegaran, Kumbesan
Format: Article
Language:English
Published: Inderscience 2013
Subjects:
TK5101 Telecommunication. Including telegraphy, radio, radar, television
Online Access:http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/1/IJMC_11105_Ramli_and_Sandrasegaran_%282%29_%281%29.pdf
id iium-28336
recordtype eprints
spelling iium-283362017-08-14T03:16:31Z http://irep.iium.edu.my/28336/ Robust scheduling algorithm for guaranteed bit rate services Mohd. Ramli, Huda Adibah Sandrasegaran, Kumbesan TK5101 Telecommunication. Including telegraphy, radio, radar, television 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. Inderscience 2013-01 Article PeerReviewed application/pdf en http://irep.iium.edu.my/28336/1/IJMC_11105_Ramli_and_Sandrasegaran_%282%29_%281%29.pdf Mohd. Ramli, Huda Adibah and Sandrasegaran, Kumbesan (2013) Robust scheduling algorithm for guaranteed bit rate services. International Journal of Mobile Communocations, 11 (1). pp. 71-88. ISSN 1741-5217 http://www.inderscience.com/jhome.php?jcode=ijmc 10.1504/IJMC.2013.050996
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic TK5101 Telecommunication. Including telegraphy, radio, radar, television
spellingShingle TK5101 Telecommunication. Including telegraphy, radio, radar, television
Mohd. Ramli, Huda Adibah
Sandrasegaran, Kumbesan
Robust scheduling algorithm for guaranteed bit rate services
description 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.
format Article
author Mohd. Ramli, Huda Adibah
Sandrasegaran, Kumbesan
author_facet Mohd. Ramli, Huda Adibah
Sandrasegaran, Kumbesan
author_sort Mohd. Ramli, Huda Adibah
title Robust scheduling algorithm for guaranteed bit rate services
title_short Robust scheduling algorithm for guaranteed bit rate services
title_full Robust scheduling algorithm for guaranteed bit rate services
title_fullStr Robust scheduling algorithm for guaranteed bit rate services
title_full_unstemmed Robust scheduling algorithm for guaranteed bit rate services
title_sort robust scheduling algorithm for guaranteed bit rate services
publisher Inderscience
publishDate 2013
url http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/
http://irep.iium.edu.my/28336/1/IJMC_11105_Ramli_and_Sandrasegaran_%282%29_%281%29.pdf
first_indexed 2023-09-18T20:41:50Z
last_indexed 2023-09-18T20:41:50Z
_version_ 1777409416571650048

Similar Items