1 / 13

EDCA Enhancements for HEW

EDCA Enhancements for HEW. Date: 2013-09-15. Authors:. Abstract. With the development of throughput in WLAN, many new kinds of data will flow through WLAN networks. This presentation discusses the enhancement of EDCA and introduces a hierarchical scheduling model to deal with new situations.

chiku
Télécharger la présentation

EDCA Enhancements for HEW

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. EDCA Enhancements for HEW Date: 2013-09-15 Authors:

  2. Abstract With the development of throughput in WLAN, many new kinds of data will flow through WLAN networks. This presentation discusses the enhancement of EDCA and introduces a hierarchical scheduling model to deal with new situations.

  3. Background(1/2) • HEW address “improving real world performance” • Parameterized and guaranteed QoE may be a solution • Today only the IEEE 802.11e std. is available • HCCA for parameterized QoS • EDCA for differentiated QoS • IEEE 802.11e EDCA defines traffic classes to classify packets of 4 Access Categories. • AC_BK is the lowest priority for background data • AC_BE is the next priority for best-effort data • AC_VI is the priority for video applications • AC_VO is the priority for voice applications • The packets for the same AC are enqueued in FCFS queue with drop tail technique (EDCAF).

  4. Background(2/2) • In the HEW system data traffic, except bulk data, there are still many short packets. They may be minor part of total data volume, but major amount of data packets[1] • While 4K&8K/Ultra-HD supported, there are also many 360P/480P video. • Some users are BitTorrent downloading, others may check their e-mail or Facebook. • The former EDCA do not differentiate length and type of the data packets in the same AC.

  5. Motivation In the former EDCA, the FCFS scheduler is easy to implement. But it only considers the waiting time of the packets, while length of packets are ignored. Therefore, the FCFS is propitious to long packets but not conducive to the short packets. When dealing with massive burst short packets, the cycling time will increase, and the delay of short packets may be unacceptable.

  6. Hierarchical Scheduler • We introduce a hierarchical scheduling model • Add an auxiliary parameter AAC (auxiliary access categories) to each packet after the AC parameter. The AACs are depending on the detail properties of the packet, length for example. • And in each AC, an extra scheduler is added with different AACs, to make each AAC flow has a similar throughput.

  7. IP Network Layer Interface AC0 AC1 8 Priorities Classified in 4 Access Categories n Flows Divided by AAC Hierarchical Scheduler Procedure(1/2) Qn Q0 AC3 AC2 …… • The eligible packet must pass through hierarchical scheduling levels: • Step 1: H-EDCA receives the packets from the upper layer, then classifies the packets into 4 classes as defined in EDCA specifications. Added Scheduler(level one) …… …… …… Former EDCA Reference Implementation Model Original Scheduler(level two) Attempt to transmit and access channel

  8. IP Network Layer Interface AC0 AC1 8 Priorities Classified in 4 Access Categories n Flows Divided by AAC Hierarchical Scheduler Procedure(2/2) Qn Q0 AC3 AC2 …… • STEP 2: In each AC, it divides the packets into n flows depending on AAC of each packet. Define one queue for each flow. • STEP 3: For dequeueing, an added scheduler (level one) will serve the packet queued at the head of queue that has the earliest finish-number, between packets that their start-number are below the threshold. • STEP 4: The eligible packet at each AC waits its backoff and AIFS, depending on its AC, depending on its priority (level two). • Then the node attempts to transmit the eligible packet Added Scheduler(level one) …… …… …… Original Scheduler(level two) Attempt to transmit and access channel

  9. L(1,q) Pq(1) Threshold Algorithm for H-scheduler(1/2) L(2,1) L(1,1) P1(2) P1(1) Queue 1 Min.{F | S≤V} F(1,1) S(1,1) Output Added scheduler in AC Queue 2 Queue q F(1,q) S(1,q) Queue n V(1) For the added scheduler in each AC, we introduce a threshold WFQ algorithm for example.

  10. L(1,q) Pq(1) Threshold Algorithm for H-scheduler(2/2) L(2,1) L(1,1) P1(2) P1(1) Queue 1 Min.{F | S≤V} F(1,1) S(1,1) Output Added scheduler in AC Queue 2 Queue q F(1,q) S(1,q) Queue n V(1) ensure the fairness for long packets give a higher priority to short packets

  11. Simulation 1Mbits Threshold WFQ FCFS Compared with the FCFS, the Threshold WFQ gives each AAC flow a fairer opportunity to transmit packets. • We assume that there are packets of 4 AACs. • ACC 0 for packets below 100 bytes • ACC 1 for packets between 100 to 2000 bytes • ACC 2 for packets between 2000 to 10000 bytes • ACC 3 for packets above 10000 bytes • The packets are transmitted by FCFS in original EDCA and Threshold WFQ in Hierarchical Scheduler respectively, during 1ms with the total transmission rate of 1Gbps (1Mbits=1Gbps*1ms).

  12. Suggestion • Suggestion 1: The Auxiliary Access Categories and Hierarchical Scheduler model might be considered in HEW, due to the diversity of traffic. • The detail scheduler algorithm and parameter settings may be studied in the future. • Suggestion 2: The enhancement of EDCA needs to be considered in future discuss to deal with new traffic models in HEW.

  13. References [1] 11-13-0728-01-0hew-network-optimization-for-expected-traffic-patterns [2] Abuzanat, H. ; Trouillet, B. ; Toguyeni, A. “FQ-EDCA: An extension of EDCA to improve fairness in ad-hoc wireless network”. Computers & Industrial Engineering, 2009. CIE 2009. pp.1617-1622

More Related