310 likes | 439 Views
Quality of Service Scheduling for 802.16 Broadband Wireless Access Systems. Jonny SUN, Yanling YAO, Hongfei ZHU IEEE Vehicular Technology Conference, 2006. Outline. Introduction IEEE 802.16 BWA System QoS Scheduling for 802.16 Systems QoS Scheduling Architecture for 802.16 System
E N D
Quality of Service Scheduling for 802.16 Broadband Wireless Access Systems Jonny SUN, Yanling YAO, Hongfei ZHU IEEE Vehicular Technology Conference, 2006
Outline • Introduction • IEEE 802.16 BWA System • QoS Scheduling for 802.16 Systems • QoS Scheduling Architecture for 802.16 System • Scheduling Algorithm at BS • Scheduling Algorithm at SS • Simulation • Conclusion
Introduction • Motivation • Providing QoS in BWA systems has become a very important • The rapid growth trend in the use of wireless data services and multimedia application • IEEE 802.16 specification does not contain an efficient schedule to support the heterogeneous traffic
Introduction • Goal • Propose an efficient QoS strategy based on the hierarchical and distributed architecture • Base Station (BS) Scheduler • grant BW to SSs according to the request and reservation • Subscriber Station (SS) Scheduler • re-distribute the received transmission opportunities among all of its connection
IEEE 802.16 BWA Systems • PMP Architecture • DL transmission is relatively simple • BS is the unique sender broadcasting to all the SSs without coordination with other stations • UL transmission is relatively hard • SSs should coordinate with their neighbor before UL transmission • BS should control the resource allocation of UL access
IEEE 802.16 BWA Systems • MAC Operation is connection-oriented • Enable end-to-end QoS for different end users • Four types of scheduling services • Unsolicited Grant Service (UGS) • real-time Polling Service (rtPS) • Non-real-time Polling Service (nrtPS) • Best Effort (BE)
Unsolicited Grant Service (UGS) • Traffic attributes • Real-time CBR or CBR-like • Fixed-sized, periodic • Key Service parameters • Maximum sustained traffic rate • Maximum latency • Tolerated jitter
real-time Polling Service (rtPS) • Traffic attributes • Real-time VBR service flow • Variable-sized, periodic • Key Service parameters • Maximum sustained traffic rate • Minimum reserved traffic rate • Maximum latency
Non-real-time Polling Service (nrtPS) • Traffic attributes • Non-real-time VBR service flow • Minimum BW grantee • Longer delay allowed • Key Service parameters • Maximum sustained traffic rate • Minimum reserved traffic rate • Traffic Priority
Best Effort (BE) • Traffic attributes • The same with nrtPS • Depends on traffic load • Key Service parameters • Maximum sustained traffic rate • Traffic Priority
SS Scheduler Traffic Traffic Classification QoS Scheduling Architecture BS Scheduler Type I Queue BW Request UGS data & dedicated request opportunities nrtPS,rtPS and BE Type II Queue
Scheduling Algorithm at BS • Priority Queue Concept • Type I Queue • Used to schedule data grants for UGS • Allocate dedicated request opportunities for rtPS and nrtPS • FIFO discipline
Scheduling Algorithm at BS • Type II Queue • Used to schedule data grants for rtPS, nrtPS, and BS based on the information contained in the BW request messages • Fair queuing algorithm • Minimum reserved BW assurance • Excess BW distribution
BW actually allocated during the phase Minimum reserved BW assurance Minimum reserved BW for connection i BW currently demanded by the connection i Available BW
Excess BW distribution Remained BW The amount of excess BW allocated to connection i Pre-assigned connection weight
The priority of different scheduling services Scheduling Algorithm at SS
Priority Queue Select the packet to be transmitted from queue i Queue (i+1) empty ?? Yes No Transmit Select the packet to be transmitted from queue (i+1)
Scheduling Algorithm at SS • Inner Queue Scheduling • Scheduling algorithm for rtPS queues • Scheduling algorithm for nrtPS queues • Scheduling algorithm for BE queues
Scheduling algorithm for rtPS queues • Goal • Tight delay bound should be meet • Solution • Each packet entering the rtPS queues should be marked with a delivery deadline • Schedule all of the packets based on the deadline stamp
Scheduling algorithm for nrtPS queues • Goal • Throughput maintenance • Solution • Similar to rtPS Guaranteed BW share of connection i Virtual Timestamp associated with kth packet of connection i The length of kth packet
Scheduling algorithm for BS queues • No QoS guarantee required • Solution • FIFO mechanism
Simulation • PHY Configuration Parameters
Conclusion • This paper proposed a QoSscheduling algorithm based on • Hierarchical • Distributed • Simulation results prove • guarantee the minimum BW for each service flow • ensure fairness and QoS in distributing excess BW among all connections.