A Scheduling Scheme for Level-2 Enhanced PCF MAC Service

Slides:



Advertisements
Similar presentations
Doc.: IEEE /387r1 Submission November 2000 W.-P. Ying, M. Nakahara, S. Ho, NextComm, Inc.Slide 1 A Scheduling Scheme for Level-2 Enhanced PCF.
Advertisements

Doc.: IEEE /1123r0 Submission September 2010 Zhu/Kim et al 1 Date: Authors: [TXOP Sharing for DL MU-MIMO Support]
QoS In WLAN By Abdulbaset Hassan Muneer Bazama. Outline Introduction QoS Parameters medium access control schemes (MAC) e medium access.
Session: IT 601: Mobile Computing IEEE e Prof. Anirudha Sahoo IIT Bombay.
Multi-Class QoS in Networks Using GDMC IEEE Globecom 2007 – Washington, DC Friday, November 30, 2007 Bushra Anjum North Carolina State University.
1 Medium Access Control Enhancements for Quality of Service IEEE Std e TM November 2005.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
Submission doc.: IEEE /1454r0 November 2014 Jarkko Kneckt (Nokia)Slide ax Power Save Discussion Date: Authors:
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
IEEE EDCF: a QoS Solution for WLAN Javier del Prado 1, Sunghyun Choi 2 and Sai Shankar 1 1 Philips Research USA - Briarcliff Manor, NY 2 Seoul National.
1 Medium Access Control Enhancements for Quality of Service IEEE Std e TM November 2005.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Doc.: IEEE /1280r1 November 2015 SubmissionStéphane Baron et. al., Canon Traffic priority for random Multi User Uplink OFDMA Date: Slide.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Doc.: IEEE /457 Submission December 2000 Mathilde Benveniste, AT&T Labs - ResearchSlide 1 An Enhanced-DCF Proposal Based on ‘Tiered Contention’
MAC for WLAN Doug Young Suh Last update : Aug 1, 2009 WLAN DCF PCF.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
Doc.: IEEE /361 Submission October 2000 Wim Diepstraten, LucentSlide 1 Distributed QoS resolution Greg Chesson-Altheros Wim Diepstraten- Lucent.
November 2000 Jin-Meng Ho, Texas InstrumentsSlide 1 doc.: IEEE /367 Submission p-DCF for Prioritized MAC Service Jin-Meng Ho, Sid Schrum, and.
AIFS – Revisited Mathilde Benveniste
Medium Access Control. MAC layer covers three functional areas: reliable data delivery access control security.
Mathilde Benveniste Avaya Labs
EA C451 (Internetworking Technologies)
IEEE e Performance Evaluation
Undetected Duplicate Frame Reception
Overview of ‘Tiered Contention’ Multiple Access (TCMA)
Topics in Distributed Wireless Medium Access Control
UL OFDMA Random Access Control
Lecture 27 WLAN Part II Dr. Ghalib A. Shah
An Access Mechanism for Periodic Contention-Free Sessions
WUR coexistence with existing power save mode
AP access procedure for UL MU operation
QoS Handling of Trigger Frame
IEEE : Wireless LANs ALOHA, Slotted ALOHA
Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Proposal for Collaborative BT and b MAC Mechanisms.
HCF medium access rules
Using Dynamic PCF to improve the capacity of VoIP traffic in IEEE 802
AIFS – Revisited Mathilde Benveniste
Traffic priority for random Multi User Uplink OFDMA
Power Management in IEEE
CC/RR Performance Evaluation - Revisited
Provision of Multimedia Services in based Networks
Speaker:Fu-Yuan Chuang Advisor:Ho-Ting Wu Date:
Simulation Results for QoS, pDCF, VDCF, Backoff/Retry
Suggested comment resolution on MDA Access Fraction (MAF)
Multicast/Broadcast Communication With Acknowledge
Protocol Details John Bellardo UCSD.
QoS in Wireless Networks
Texas Instruments Incorporated
Performance Evaluation of an Integrated-service IEEE Network
Burst Transmission and Acknowledgment
HCF medium access rules
Neighborhood Capture and OBSS
TGe Consensus Proposal
Power saving mechanism consideration for ah framework
Comment resolution on CID 20175
Group Block Acknowledgements for Multicast Traffic
DL MU MIMO Error Handling and Simulation Results
HCF medium access rules
Student : Min-Hua Yang Advisor : Ho-Ting Wu Date :
PCF Enhancements and Contention Free Bursts
Multiple Frame Exchanges during EDCF TXOP
Comment resolution on CID 20175
HCF medium access rules
Prioritized MAC Access Mechanism of Routing-related Frame for ESS Mesh
Cooperative AP Discovery
Infocom 2004 Speaker : Bo-Chun Wang
Chapter 11 Comment Resolution for Letter Ballot 63
Wireless MAC Multimedia Extensions Albert Banchs, Witold Pokorski
Presentation transcript:

A Scheduling Scheme for Level-2 Enhanced PCF MAC Service November 2000 A Scheduling Scheme for Level-2 Enhanced PCF MAC Service Wen-Ping Ying Mike Nakahara Sigong Ho NextComm, Inc. Kirkland, Washington W.-P. Ying, M. Nakahara, S. Ho

Nature of Level-0 CF DCF – PCF – November 2000 Nature of Level-0 CF DCF – Channel Access is probabilistically fair. Medium contention is a function of offered load from higher layer. Congestion control is achieved via backoff. In favor of more contentious applications. PCF – Channel Access is deterministically fair. Medium contention is independent of offered load from higher layer (relatively speaking) No need for congestion control (except retry treatment). W.-P. Ying, M. Nakahara, S. Ho

Base-line Model As Proposed In vDCF Scheme November 2000 Base-line Model As Proposed In vDCF Scheme D-SAP M-SAP 802 D-SAP, 3-bit traffic class Number of Q’s depends on QoS level MPDU Scheduler Scheduler Level-0 Channel access function independent of scheduler Access W.-P. Ying, M. Nakahara, S. Ho

November 2000 Objective of vDCF QoS To prioritize frames based on a common scheduling algorithm observed by all STAs. To use the Level-0 channel access mechanism (CSMA/Poll) for delivering prioritized frames. To have the same behavior as non-QoS model when every frame has equal priority. W.-P. Ying, M. Nakahara, S. Ho

November 2000 Level-2 PCF Basic Model Use a similar scheduler as in Level-1so that switching between CFP and CP will not result in major scheduling mechanism switches. During CFP – the random number generation aspect of vDCF is used as the scheduling mechanism to rank order/prioritize the frames for transmission. The Level-0 PCF polling determines the channel access opportunity (Tx-Op). During CP (vDCF) – the same random number used in rank ordering determines the relative backoffs and sequence for frame transmission (as specified in vDCF). The Level-0 DCF channel sensing determines the channel access opportunity (Tx-Op). The “Load monitor” information (CW vector) announced by AP during CFP may be adopted by STA so that STA can adjust to the network dynamics when CP begins. W.-P. Ying, M. Nakahara, S. Ho

Level-2 Pollable-STA in CFP November 2000 Level-2 Pollable-STA in CFP Prioritization Scheduler F3 CW3 F3(3) F2 CW2 Poll F2(10) Serialization F1(3) F0(9) F2(7) F3(3) F1 CW1 Tx Queue Tx F1(22) F0 CW0 F0(19) Access differentiation controlled by a CW parameter per priority category as stated in the proposed base line vDCF document. Only one frame from one priority queue to be retrieved by the Scheduler. The backoff count is used only for proper rank ordering during this period. No backoff count decrement shall be performed. The first frame on the Tx Q shall be transmitted upon receiving a poll independent of the backoff mechanism (backoff counter value of the frame). When a frame is successfully transmitted, a new frame from that priority queue is retrieved (or frames, one from each previously empty queue.) Rescheduling is performed as described in the base line document. Scheduler may adopt the CW vector during this period so that when transiting to CP, the backoff values are up-to-date with the dynamics of the network. W.-P. Ying, M. Nakahara, S. Ho

Scheduling Alternative November 2000 Scheduling Alternative Prioritization F3 CW3 Scheduler F3(3) F2 Poll CW2 F2(10) Serialization F3(3) F1 CW1 Tx Buffer Tx F1(22) F0 CW0 F0(19) Access differentiation controlled by a CW parameter per priority category as stated in the proposed base line vDCF document. Only one frame from each priority queue is used by the Scheduler for selection purpose. The same random number generation based on the CW is used to tag the priority of the frames. The one with the smallest number is selected to be delivered at the next TxOp. When a frame is successfully transmitted, all the frames at the front of each priority queue are used for the priority selection process again Scheduler may adopt the CW vector during this period so that when transiting to CP, the backoff values are up-to-date with the dynamics of the network. If the CW vector is not kept up-to-date, the last CW vector may be used for Level-1 scheduling processing (or learn from the next load monitoring frame.) W.-P. Ying, M. Nakahara, S. Ho

November 2000 Level-2/1 STA in CP Prioritization Scheduler F3 CW3 F3(3) Backoff F2 CW2 F2(10) Serialization F1(3) F0(9) F2(7) F3(3) F1 CW1 Tx Queue F1(22) TxOP based on the DCF channel access mechanism F0 CW0 F0(19) Same access differentiation controlled by the CW mechanism outline in the previous slide. Only one frame from one priority queue to be retrieved by the Scheduler. The backoff count is used sort out a delay sequence for transmission during this period. The legacy DCF backoff procedure is used as stated in vDCF base line. When making transition from CFP to CP, the Scheduler reuses the backoff counters from the CFP for backoff purpose. This process remains the same for both pollable (Level-2) and non-pollable (Level-1) STA since the adoption of CW vector is required even during CFP. This scheme shall be the same as Level-1 proposal. W.-P. Ying, M. Nakahara, S. Ho

November 2000 Level-2 AP in CFP Level-0 pollable STAs A1 A2 A3 Non-pollable STAs A1 A2 A3 An NP Burst mode delivery Polling & Frame Delivery Accommodate priority scheduling to Level-0 CFP polling mechanism in order to maintain the same level of performance as Level-0 CFP if all the frames have the same priority. Level-2 AP has to operate as a Point Coordinator for delivery and polling. All frames are regrouped based on the destination address and the pollability of the destination. Within each destination group, the same prioritization and scheduling as Level-2 pollable STA is used. W.-P. Ying, M. Nakahara, S. Ho

November 2000 Level-2 AP in CFP – Cont. Level-0 pollable STAs A1 A2 A3 Non-pollable STAs A1 A2 A3 An NP Burst mode delivery Polling & Frame Delivery The delivery of frames follows the sequence of the polling list AP generated. AP retrieves one frame from the scheduler of the address group being polled and piggybacks the frame in the Poll. All frames destined to non-pollable STAs are put into the same group in the order of arrival and the priority classification. AP shall retrieve frames from the non-pollable STA group after polling all the STAs at least once. The delivery of such frames can be in burst as described in vDCF proposal. Polling list shall be accessed in the round-robin fashion throughout CFP periods to ensure fairness in allowing the Level-2 STA to transmit. W.-P. Ying, M. Nakahara, S. Ho

November 2000 Level-2 AP in CFP – Cont. Note: 1999 standard allows the immediate delivery of polled frame to non-pollable STA but encourages the buffering of polled frames to pollable STA such that piggy-back polling & delivery can be used to reduce the overhead. In this proposal, we recommend the latter so that there is no preference to the polled frame destined to non-pollable STA over pollable STA. We further recommend to deliver buffered frames destined to non-pollable STA at the end of the polling list. This NP delivery can be in burst mode as suggested in vDCF proposal to increase the efficiency of the delivery. W.-P. Ying, M. Nakahara, S. Ho

Level-2 AP in CP AP behaves as a Level-1 AP during CP. November 2000 Level-2 AP in CP AP behaves as a Level-1 AP during CP. All the destination group queues and the non-pollable queues are collapsed into one 4-priority category queue. AP maintains this 4-priority category CP queue with all the outbound frames sorted in the order of time of arrival and priority category independent of the frame destination. Upon making transition to the CP, the Scheduler regenerates the Tx queue based on the result of the last CFP delivery. One undelivered frame from each of the CP priority queue will be used to generate the Tx queue using the prevailing CW vector information. The mapping between the CFP queues and the CP queues is implementation dependent (apparently an efficient way to obtain the Tx Queue is required when switching between CFP and CP.) The AP waits for the channel access mechanism to be cleared to deliver the frames in Tx queue. W.-P. Ying, M. Nakahara, S. Ho

Level-2 Protocol Simplified (Interoperability) November 2000 Level-2 Protocol Simplified (Interoperability) Level-0 N-Poll/ Level-1 dwn-lnk Level-3 Level-2/0 PCF DCF QoS Data Data Data Burst Data CC CF-End CC CCI CF-multipoll CF-Poll Data CF-Poll No change to the Level-0 PCF Channel Access Mechanism drop RR, CC, CF-Multipoll from the Level-3 protocol. Polling sequence is vendor specific. Scheduling mechanism may be simplified during CFP for prioritization efficiency. Support new QoS load element for CW vector update. Support new Mgmt Action messages as needed (channel Management. W.-P. Ying, M. Nakahara, S. Ho

Benefit of Level-2 QoS Virtue of Level-0 PCF Polling: November 2000 Benefit of Level-2 QoS Virtue of Level-0 PCF Polling: Predictable fair-share among all pollable STAs. Efficient data transfer. Less overhead. Reduced chance of medium contention. Virtue of Local Prioritization: Prioritization process is distributed. For each Level-2 (pollable) STA, frames with higher priority have higher probability to be delivered and received. No starvation of STA with only low priority frames W.-P. Ying, M. Nakahara, S. Ho

Conclusion A Level-2 QoS Architecture is proposed for both STA and AP. November 2000 Conclusion A Level-2 QoS Architecture is proposed for both STA and AP. When operating during the CP, the QoS mechanism is the same as Level-1 QoS. Same Scheduler may be used for both Levels to allow ease of transition between CFP and CP. Priority Queues on AP change between CFP & CP but stay the same for STA. W.-P. Ying, M. Nakahara, S. Ho