Robust scheduling algorithm for Guaranteed Bit Rate services

Ramli, HAM; Sandrasegaran, K

Robust scheduling algorithm for Guaranteed Bit Rate services

Ramli, HAM Sandrasegaran, K

Permalink

Publication Type:: Journal Article
Citation:: International Journal of Mobile Communications, 2013, 11 (1), pp. 71 - 88
Issue Date:: 2013-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (545.54 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Ramli, HAM	en_US
dc.contributor.author	Sandrasegaran, K https://orcid.org/0000-0003-1270-5756	en_US
dc.date.issued	2013-01-01	en_US
dc.identifier.citation	International Journal of Mobile Communications, 2013, 11 (1), pp. 71 - 88	en_US
dc.identifier.issn	1470-949X	en_US
dc.identifier.uri	http://hdl.handle.net/10453/27496
dc.description.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. Copyright © 2013 Inderscience Enterprises Ltd.	en_US
dc.relation.ispartof	International Journal of Mobile Communications	en_US
dc.relation.isbasedon	10.1504/IJMC.2013.050996	en_US
dc.subject.classification	Information Systems	en_US
dc.title	Robust scheduling algorithm for Guaranteed Bit Rate services	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	11	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	open_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	11	en_US

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. Copyright © 2013 Inderscience Enterprises Ltd.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/27496