Scheduled DCF vs. Virtual DCF

Slides:



Advertisements
Similar presentations
Doc.: IEEE /351 Submission October 2000 Maarten Hoeben, Menzo Wentink, IntersilSlide 1 Enhance D-QoS through Virtual DCF Maarten Hoeben, Menzo.
Advertisements

Doc.: IEEE /011r1 Submission January, 2001 Wim Diepstraten, Agere Systems Slide 1 Comparing V-DCF with other EDCF proposals Wim DiepstratenAgere.
Comp Spring 2003 Delay Jitter Ketan Mayer-Patel.
1 of 56 Idle Sense: An Optimal Access Method for High Throughput and Fairness in Rate Diverse Wireless LANs Martin HeusseFranck Rosseau Romaric GuillierAndrzej.
1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.
1 Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks INFOCOM 2001 Michael Barry, Andrew T. Campbell Andras Veres.
Doc.: IEEE /328r0 Submission May 2001 Menzo Wentink, Intersil Slide 1 Interpretations of Backoff Menzo Wentink Intersil
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Efficiency Reservation Protocols Voice and Data Techniques - PRMA - Variable rate CDMA.
Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York, Stony Brook.
Opersating Mode DCF: distributed coordination function
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Company LOGO Provision of Multimedia Services in based Networks Colin Roby CMSC 681 Fall 2007.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
Doc.: IEEE /398 Submission October 2000 Wim Diepstraten, LucentSlide 1 Initial D-QoS Proposal Maarten Hoeben-Intersil/NWN Menzo Wentink-Intersil/NWN.
Main Memory CS448.
Doc.: IEEE /065r0 Submission January 2001 Brockmann, Hoeben, Wentink (Intersil) g MAC Analysis Menzo Wentink Ron Brockmann.
1 Performance Analysis of the Distributed Coordination Function under Sporadic Traffic joint work with C.-F. Chiasserini (Politecnico di Torino)
Contents  Teleoperated robotic systems  The effect of the communication delay on teleoperation  Data transfer rate control for teleoperation systems.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
1 Chapter 4 Fundamental Queueing System. 2 3 Ref: Mischa Schwartz “Telecommunication Networks” Addison-Wesley publishing company 1988.
1 Chapter 4 Fundamental Queueing System
Doc.: IEEE /126 Submission May 2000 Amar Ghori et.al., ShareWaveSlide 1 Answer to QoS Questions Amar Ghori Steven Gray Evan Green Raju Gubbi Maarten.
Doc.: IEEE /361 Submission October 2000 Wim Diepstraten, LucentSlide 1 Distributed QoS resolution Greg Chesson-Altheros Wim Diepstraten- Lucent.
Doc.:IEEE /0313r1 Submission Robert Stacey (Intel) March 12, 2010 Slide 1 Rekeying Protocol Fix Authors: Date:
Doc.: IEEE /0624r2 SubmissionLiwen Chu Etc.Slide 1 Scheduled Medium Access For Large Low Power BSS Date: Authors: Date: May, 2012.
November 2000 Jin-Meng Ho, Texas InstrumentsSlide 1 doc.: IEEE /367 Submission p-DCF for Prioritized MAC Service Jin-Meng Ho, Sid Schrum, and.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
Doc.:IEEE /566r2 Submission November 2001 S. Choi, Philips & M.M. Wentink, Intersil Slide 1 Multiple Frame Exchanges during EDCF TXOP Sunghyun.
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai.
Doc.: IEEE /2952r2 Submission Dec 2007 L.Chu Etc.Slide 1 Simplified DLS Action Frame Transmission in 11Z Date: Authors:
AIFS – Revisited Mathilde Benveniste
Balancing Uplink and Downlink Delay of VoIP Traffic in WLANs
Topics in Distributed Wireless Medium Access Control
HCF and EDCF Simulations
An Access Mechanism for Periodic Contention-Free Sessions
AP access procedure for UL MU operation
QoS Handling of Trigger Frame
ECA Overview (Enhanced Contention Access)
Using Dynamic PCF to improve the capacity of VoIP traffic in IEEE 802
An Embedded Software Primer
A Scheduling Scheme for Level-2 Enhanced PCF MAC Service
CC/RR Performance Evaluation - Revisited
Provision of Multimedia Services in based Networks
EDCF Traffic Categories and Access Parameters
Speaker:Fu-Yuan Chuang Advisor:Ho-Ting Wu Date:
Enhanced Channel Access Joint Proposal
Simulation Results for QoS, pDCF, VDCF, Backoff/Retry
An alternative mechanism to provide parameterized QoS
Simulation for EDCF Enhancement Comparison
6 GHz operation for 11ax Date: Name Affiliation Address
EDCA Backoff Rules Mathilde Benveniste
VDCF Presentation Greg Chesson,
Scheduled Medium Access For Large Low Power BSS
EE 122: Lecture 7 Ion Stoica September 18, 2001.
An alternative mechanism to provide parameterized QoS
Rekeying Protocol Fix Date: Authors: Month Year
of the IEEE Distributed Coordination Function
PCF Enhancements and Contention Free Bursts
Multiple Frame Exchanges during EDCF TXOP
Piggybacked Inter-Service Time
Simplified DLS Action Frame Transmission in 11Z
Performance-Robust Parallel I/O
Revisiting Path Switch
EDCF Editing Instructions
Considerations of New Queue Mechanism for Real-Time Application
Presentation transcript:

Scheduled DCF vs. Virtual DCF October 2000 Scheduled DCF vs. Virtual DCF Maarten Hoeben, Menzo Wentink Intersil Maarten Hoeben, Menzo Wentink, Intersil

Goal To compare the two proposed D-QoS solutions: V-DCF (Virtual DCF) October 2000 Goal To compare the two proposed D-QoS solutions: V-DCF (Virtual DCF) Each class has an independent Virtual DCF S-DCF (Scheduled DCF) Each station has one DCF which uses the CW for the highest backlogged class. An internal scheduler provides for rate adaptation in the case that more than one local class has backlogged traffic Maarten Hoeben, Menzo Wentink, Intersil

October 2000 Scheduled DCF Scheduler Class 3 Class 2 DCF - CWi Class 1 Class 0 Station S-DCF stations merge traffic from different classes in the scheduler, prior to sending the muxed stream into the DCF The DCF uses the CW value corresponding to the highest backlogged queue i (CWi). The CW values are controlled by the AP The scheduler can be vendor specific but the ratios are probably controlled by the AP Maarten Hoeben, Menzo Wentink, Intersil

Scheduled DCF CONS PROS October 2000 Scheduled DCF CONS Stations must implement a scheduler  more complexity Many variables must be controlled: CW and scheduler ratios. Traffic from different classes is multiplexed in two different ways, which do not result in similar behavior: Locally: in the Scheduler Remotely: through the DCF This will result in an intrinsically unfair system! – see example PROS The number of contenders is the same as the number of stations Maarten Hoeben, Menzo Wentink, Intersil

Virtual DCF Stations maintain a separate (virtual) DCF for each class. October 2000 Virtual DCF Class 3 V-DCF CW3 Class 2 V-DCF CW2 Class 1 V-DCF CW1 Class 0 V-DCF CW0 Station Stations maintain a separate (virtual) DCF for each class. CW values are controlled by the AP The V-DCFs (implicitly) merge the traffic Maarten Hoeben, Menzo Wentink, Intersil

October 2000 Virtual DCF CONS Increased number of medium contenders, especially when classes are frequently used in parallel But this is an advantage for the Access Point PROS No scheduler required in stations, which reduces complexity Predictable and fair inter-station behavior Easy to understand conceptually Smallest possible number of variables to be managed Under the assumption that most stations will use only one class at a time, V-DCF is the simplest solution The AP (which will usually have traffic in all of it’s queues) becomes more aggressive Maarten Hoeben, Menzo Wentink, Intersil

S-DCF Fairness Issue Example: October 2000 S-DCF Fairness Issue Example: Several stations are transmitting Class 2 traffic only. All S-DCFs use the same CW (CW2), so on average the individual streams will be equal in size. One station starts transmitting Class 3 traffic also, while it keeps on sending the Class 2 traffic. The S-DCF in that station will switch to a new CW (CW3) and start transmitting the Class 3 traffic, while it interleaves the Class 2 frames. The Class 2 rates from other stations will automatically adapt to the presence of the additional Class 3 traffic, and the DCF again ensures that on average each Class 2 stream will be equal in size. However, the Class 2 stream that comes from the station with Class 3 traffic will be determined by the internal scheduler. So while all Class 2 rates are (indirectly) determined by the ensemble of DCFs, there is one Class 2 rate which is determined by the scheduler. Theoretically that rate could be the same, but it is very likely that it is not. This a a fundamental fairness issue with S-DCF. Maarten Hoeben, Menzo Wentink, Intersil

S-DCF Fairness Issue (cnt’d) October 2000 S-DCF Fairness Issue (cnt’d) Class 3 Traffic Scheduler DCF(CW3) Class 3 traffic + Class 2 traffic Class 2 Traffic Station A Scheduler Class 2 Traffic DCF(CW2) Class 2 traffic Station B Fairness demands that the Class 2 traffic streams from station A and B are the same (statistically) The intrinsic problem with S-DCF is that traffic is multiplexed in two different ways: locally in the scheduler AND remotely by the DCF’s. Maarten Hoeben, Menzo Wentink, Intersil

Fairness in V-DCF DCF is a fair mechanism, so V-DCF is also October 2000 Fairness in V-DCF DCF(CW3) Class 3 Traffic Class 3 traffic Class 2 Traffic DCF(CW2) Class 2 traffic Station A (V-DCF) DCF(CW2) Class 2 Traffic Class 2 traffic Station B (V-DCF) DCF is a fair mechanism, so V-DCF is also Maarten Hoeben, Menzo Wentink, Intersil