1 / 27

Overview of ‘Tiered Contention’ Multiple Access (TCMA)

Overview of ‘Tiered Contention’ Multiple Access (TCMA). Mathilde Benveniste AT&T Labs, Research. Relevant submissions: IEEE 802.11-00/375 (.ppt and .doc); -00/456; -00/457; -01/002; -01/003; -01/004. TCMA features. Basic Contention Resolution

saskia
Download Presentation

Overview of ‘Tiered Contention’ Multiple Access (TCMA)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Overview of‘Tiered Contention’ Multiple Access (TCMA) Mathilde Benveniste AT&T Labs, Research Relevant submissions: IEEE 802.11-00/375 (.ppt and .doc); -00/456; -00/457; -01/002; -01/003; -01/004 Mathilde Benveniste, AT&T Labs - Research

  2. TCMA features Basic Contention Resolution • A backoff counter is drawn from a random distribution (P-DCF, V-DCF) Class Differentiation • By Initial Backoff Parameters: The parameters (offset, window size) of the starting backoff distribution vary by class (P-DCF, VDCF) • By Arbitration Time: The waiting time to start countdown after a transmission (DIFS for legacy) varies by class (No conflict) • By Retrial Backoff Parameters: The rules to update the backoff distribution following collision vary by class (No conflict) • By Dwell-Time Limit: The maximum time a packet may spend attempting transmission varies by class (No conflict) Mathilde Benveniste, AT&T Labs - Research

  3. TCMA features Averting Packet Aging • Urgency Class Upgrade: Packets in certain classes are upgraded dynamically [as their age increases] to reflect their transmission urgency (No conflict) • Packet Expiration Packets are eliminated from queue when queueing times reach class-specific thresholds (No conflict) Scheduling of Competing Traffic Streams at a Node • Parallel Queues: Class specific queues are maintained at a node with own backoff countdown (No conflict) Adaptation to Traffic Intensity: Control Mechanism • Distributed: A node (STA or AP) updates traffic from local information as needed Adaptation to Traffic Intensity: Frequency • On First Backoff: Backoff process is adjusted for traffic on first backoff (P-DCF, V-DCF) • On Retrial Backoff: Backoff process is adjusted on retrial, based on congestion estimates (P-DCF, V-DCF) • Continuous – Backoff Scaling Current backoff counter is scaled up or down if traffic intensity changes substantially Mathilde Benveniste, AT&T Labs - Research

  4. BCUT transmission Backoff countdown procedure For legacy stations: BCPT=DIFS BCUT=slot time Example All nodes are legacy stations with backoff counters m at equal to: m(A)=3; m(B)=2; m(C)=1 BCPT Node C Node B Node A Time End of last transmission BCPT =backoff counter preparation time BCUT = backoff counter update time Mathilde Benveniste, AT&T Labs - Research

  5. BCUT BCPT Node C transmission Node B Node A Time End of last transmission Urgency Arbitration Time (UAT) Differentiation by BCPT Contention resolution through backoff BCPT =backoff counter preparation time BCUT = backoff counter update time TCMA Protocol Backbone • Each urgency class is assigned a different urgency arbitration time (UAT) whose length decreases with increasing urgency. • Arbitration Time = interval that the channel must be sensed idle by a node before decreasing its backoff counter. • In congestion: • Higher urgency packets dominate the channel, as lower urgency packets get less of a chance to transmit - decrease their backoff counters. • Lower urgency packets do not collide with higher urgency packets. For stations with classification i= 0,1,... Example The backoff counter m at is equal to 1 for all nodes; m(A)= m(B)=m(C)=1 Transmit urgency ranking: (C, B, A); hence, UAT(A) >UAT(B)>UAT(C) Mathilde Benveniste, AT&T Labs - Research

  6. Traffic Re-classification (t2) Traffic Classification (t1) Priority Classes ... Urgency Classes Urgency Classes PC1 UC1 PCn UCm Averting Packet Aging • There are nPC=8 priority classes defined for all traffic packets which are permanently assigned to a packet once generated, according to 802.1d Annex H.2 • There are nUC=N urgency classes employed for channel contention • The urgency class of a packet is updated in real time so that it • reflects both the priority class of the packet and the speed with which packets of different traffic classes and ages (the time since arrival at the queue) must be transmitted • relies on the performance observed in real time Mathilde Benveniste, AT&T Labs - Research

  7. Scheduling of Competing Traffic Streams at a Node • Parallel queues shall be maintained for each class at a node, each adhering to backoff principles consistent with that class • Packets will change queues when their urgency classifications are adjusted • A packet will leave its queue if its transmission is cancelled due to excessive latency; the age threshold, aAgeLimit, will be class dependent • When a packet’s backoff counter becomes 1 it shall be placed in the node’s access buffer; in case of a tie, the higher urgency packet is selected • Packets generated by stations with multiple traffic types will thus not be disadvantaged Access Buffer Packet Stream to Node A CHANNEL TRANSMISSIONS Packet Stream to Node B Contention for access Packet Stream to Node C Mathilde Benveniste, AT&T Labs - Research

  8. Fast adaptation to traffic intensity • Bayesian stabilisation: the backoff counter is scaled up or down based on collisions or success feedback • Accounts for PCF, TCS/CTS reservation, ACKs • The age of packets is thus respected • Leading to low latency jitter, which is desirable for real-time and isochronous traffic Example: Backoff counters (1, 1, 1, 2, 2, 3) become : (1, 2, 1, 3, 4, 5) after drawing random numbers from the range [0,1]: (0, 1, 0, 0, 1, 0) while (2, 4, 7) become (1, 2, 3) Mathilde Benveniste, AT&T Labs - Research

  9. Simulation Study Overview • TCMA and V-DCF are compared for two network configurations and various traffic loads • Three priority classes are considered: High, Medium, and Low • Packets from legacy stations are treated the same as medium priority packets • The following statistics are plotted for stream aggregates referred to as “calls”: • Total throughput for all calls (bits per sec) • Goodput by call (bits per sec) • Goodput/Application load by call • Data sent by call (bits per sec) • Dropped traffic by call (bits per sec) • Media access delay (queueing plus contention time) by call (sec) • Retransmissions by call (packets per sec) Mathilde Benveniste, AT&T Labs - Research

  10. Compared Features Features simulatedfor VDCF • Differentiation by backoff offset* used on first transmission attempt • … by backoff contention window Absent from simulation • ‘Slow’ adaptation to traffic (initial and retrial backoff parameters) Refs: IEEE 802.11-00/398; -00/399; -00/412r1; -00/429; -01/011 *Offset can be used only for priorities below legacy-equivalent Features simulated for TCMA • Differentiation by UAT (urgency arbitration time) • … by backoff parameters (offset and contention window) used on first transmission attempt • … by persistence coefficient used on retrial Absent from simulation • ‘Slow’ adaptation to traffic (initial and retrial backoff parameters) • ‘Fast’ adaptation to traffic (during backoff) • Differentiation by contention time limit • Urgency class upgrade • Differentiation by limit on queueing time Refs: IEEE 802.11-00/375; -00/456; -00/457; -01/002; -01/003 Mathilde Benveniste, AT&T Labs - Research

  11. Class Description *Factor multiplying contention window following collision Mathilde Benveniste, AT&T Labs - Research

  12. OPNET Simulations • Network Configuration • Pairs of stations generate bi-directional traffic streams • One direction generates twice the volume of the other Note: Under certain scheduling assumptions, a node with streams destined to different stations can be modeled approximately as a cluster of stations • WLAN Parameters • DS, 11 Mbps channel rate • Buffer size -- 2,024,000 bits • RTS/CTS suppressed • Maximum retry limit -- 7 [See Notes below for OPNET Model settings] • Traffic Statistics • Frames of fixed size -- 1504 bytes • Inter-arrival times exponentially distributed • Packet arrival rate determined from scenario traffic load • Adjustment for PHY overhead of 192 microsecs must be made Mathilde Benveniste, AT&T Labs - Research

  13. Network Configuration A Traffic 8 stations generate 4 bi-directional streams; stream load split 1-to-2 between two directions WLAN Parameters DS, 11 Mbps channel buffer size=2.024 Mbits; no fragmentation RTS/CTS suppressed; max retry limit=7 Mathilde Benveniste, AT&T Labs - Research

  14. 5.0 Mbps 2.5 Mbps 5.0 Mbps 2.5 Mbps 0 30 90 150 Time (sec) Legacy Only Traffic Loading Mathilde Benveniste, AT&T Labs - Research

  15. 5.0 Mbps 2.5 Mbps 5.0 Mbps 2.5 Mbps 0 30 90 150 Time (sec) Legacy Only Traffic Loading Mathilde Benveniste, AT&T Labs - Research

  16. Priority 5.0 Mbps 2.5 Mbps 5.0 Mbps 2.5 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  17. Priority 5.0 Mbps 2.5 Mbps 5.0 Mbps 2.5 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  18. Network Configuration B Traffic 60 stations generate 30 bi-directional streams; stream load split 1-to-2 between two directions WLAN Parameters DS, 11 Mbps channel buffer size=2.024 Mbits; no fragmentation RTS/CTS suppressed; max retry limit=7 Mathilde Benveniste, AT&T Labs - Research

  19. Priority 3.2 Mbps 1.6 Mbps 3.2 Mbps 1.6 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  20. Priority 3.2 Mbps 1.6 Mbps 3.2 Mbps 1.6 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  21. Priority Goodput / Application Load Percent Retransmissions 1.4 100% 90% 1.2 80% 1 70% Call 1 Call 1 60% 0.8 Call 2 Call 2 50% Call 3 Call 3 0.6 3.2 Mbps 40% Call 4 Call 4 30% 0.4 20% 0.2 10% 0 0% 0 20 40 60 80 0 20 40 60 80 100 1.6 Mbps Time Time (s) Percent Retransmissions Goodput / Application Load 100% 1.4 90% 1.2 3.2 Mbps 80% 1 70% Call 1 Call 1 60% Call 2 0.8 Call 2 50% Call 3 Call 3 0.6 40% Call 4 Call 4 30% 0.4 1.6 Mbps 20% 0.2 10% 0% 0 0 20 40 60 80 0 20 40 60 80 100 Time Time (s) 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  22. Priority 3.0 Mbps 1.5 Mbps 3.0 Mbps 1.5 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  23. Priority 3.0 Mbps 1.5 Mbps 3.0 Mbps 1.0 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  24. Priority 3.0 Mbps 1.5 Mbps 3.0 Mbps 1.0 Mbps 0 30 90 150 Time (sec) QoS-Enhanced MAC TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  25. Common Scenario TCMA V-DCF Mathilde Benveniste, AT&T Labs - Research

  26. Comparison of TCMA and VDCF Similarities • Both protocols differentiate between different priorities • Both protocols transmit comparable amounts of low priority traffic Differences • TCMA transmits more of the high priority traffic • TCMA causes lower delay to the high priority traffic • TCMA results in fewer collisions Mathilde Benveniste, AT&T Labs - Research

  27. Conclusions TCMA encompasses the other two proposals, adding more features • UATs prevent collisions by packets of different priorities in congestion (high priority goes first) • Fewer collisions, greater throughput • Reduced delay • Provides greater flexibility for class differentiation in presence of legacy (offset can be used only with UATs) • Scaling permits fast adaptation to traffic without latency jitter • Class upgrades enable better compliance with QoS and fairness objectives Mathilde Benveniste, AT&T Labs - Research

More Related