Uplink scheduling algorithms for the rtPS traffic class for IEEE 80216 networks

Simple item page
buir.advisorAkar, Nail
dc.contributor.authorErtürk, Mustafa Cenk
dc.date.accessioned2016-01-08T18:07:36Z
dc.date.available2016-01-08T18:07:36Z
dc.date.issued2008
dc.descriptionAnkara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2008.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 83-86.en_US
dc.description.abstractIEEE 802.16 MAC provides extensive bandwidth allocation and QoS mechanisms for various types of applications. However, the scheduling mechanisms for the uplink and downlink are unspecified by the IEEE 802.16 standard and are thus left open for vendors’ own implementations. Ensuring QoS requirements at the MAC level for different users with different QoS requirements and traffic profiles is also another challenging problem in the area. The standard defines five different scheduling services one of them being the real-time Polling Service (rtPS). In this thesis, we propose an uplink scheduler to be implemented on the WiMAX Base Station (BS) for rtPS type connections. We propose that the base station maintains a leaky bucket for each rtPS connection to police and schedule rtPS traffic for uplink traffic management. There are two scheduling algorithms defined in this study: one is based on a simpler round robin scheme using leaky buckets for QoS management, whereas the other one uses again leaky buckets for QoS management but also a proportional fair scheme for potential throughput improvement in case of varying channel conditions. The proposed two schedulers are studied via simulations using MATLAB to demonstrate their performance in terms of throughput, fairness and delay. We show that the leaky bucket based scheduler ensures the QoS commitments of each user in terms of a minimum bandwidth guarantee whereas the proportional fair algorithm is shown to opportunistically take advantage of varying channel conditions.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T18:07:36Z (GMT). No. of bitstreams: 1 0003630.pdf: 1451277 bytes, checksum: 7224b76b1bf5b34e8c402fd7dc739384 (MD5)en
dc.description.statementofresponsibilityErtürk, Mustafa Cenken_US
dc.format.extentxiii, 86 leaves, illustrations, graphsen_US
dc.identifier.urihttp://hdl.handle.net/11693/14763
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectIEEE 802.16en_US
dc.subjectMATLABen_US
dc.subjectthroughput and delay analysisen_US
dc.subjectquality of serviceen_US
dc.subjectscheduling algorithmsen_US
dc.subject.lccTK5105.78 .E78 2008en_US
dc.subject.lcshIEEE 802.16 (Standard)en_US
dc.subject.lcshLocal area networks (Computer networks)--Standard.en_US
dc.titleUplink scheduling algorithms for the rtPS traffic class for IEEE 80216 networksen_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003630.pdf
Size:
1.38 MB
Format:
Adobe Portable Document Format
Download

Collections

Graduate School of Engineering and Science