A Fair Scheduling Scheme for HCF

Slides:



Advertisements
Similar presentations
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Advertisements

Achieving Quality of Service in Wireless Networks A simulation comparison of MAC layer protocols. CS444N Presentation By: Priyank Garg Rushabh Doshi.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
1 Medium Access Control Enhancements for Quality of Service IEEE Std e TM November 2005.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
1 Queue Scheduling Analysis The Computer Communication Lab (236340) - Winter 2004 Tanya Berezner Ana Gluzband Gitit Amihud.
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
1 Survey of Admission Control of Supporting VoIP Services in IEEE e QoS-enabled WLAN R 卓德忠 R 鍾佳芳 2 Jan
PLANETE group, INRIA Sophia-Antipolis July 1, 2003 Adaptive Channel allocation for QoS Enhancement in IEEE Wireless LANs Presented by: Mohammad.
Providing QoS in Ad Hoc Networks with Distributed Resource Reservation IEEE802.11e and extensions Ulf Körner and Ali Hamidian.
More about channels In b/g, there are 11 channels, starting at 2.412GHz at a spacing of 5MHz. Each channel owns a bandwidth of 22MHz.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Incentive-Oriented Downlink Scheduling for Wireless Networks with Real-Time and Non-Real-Time Flows I-Hong Hou, Jing Zhu, and Rath Vannithamby.
1 Medium Access Control Enhancements for Quality of Service IEEE Std e TM November 2005.
Uplink Scheduling with Quality of Service in IEEE Networks Juliana Freitag and Nelson L. S. da Fonseca State University of Campinas, Sao Paulo,
Doc.: IEEE / aa Submission May 2009 Graham Smith, DSP GroupSlide 1 Considerations for Statistical Multiplexing Support in OBSS Proposal.
Copyright © 2003 OPNET Technologies, Inc. Confidential, not for distribution to third parties. Quality of Service(QoS) in IEEE Wireless LANs: Evaluation.
Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen, Mohammad Malli, Chadi Barakat PLANETE group, INRIA.
QOS in Passive Optical Networks Ali Razmkhah Akbar Ghaffarpour Rahbar Computer Networks Research Lab, Sahand University of Technology Dec
Dynamic Bandwidth Allocation with Fair Scheduling For WCDMA Systems Liang Xu, Xumin Shen, and Jon W. Mark University of Waterloo published in IEEE Wireless.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Doc.: IEEE /0126r1 Submission January mc HEMM Date: Authors: Graham Smith, DSP GroupSlide 1.
Doc.: IEEE /577r0 Submission July 2003 Qiang NI, Pierre Ansel, Thierry Turletti, INRIASlide 1 A Fair Scheduling Scheme for HCF Qiang Ni, Pierre.
Doc.: IEEE /248r0 Submission Bobby JoseSlide 1 February 2002 Contention Free TXOP Request and Allocation Issues Bobby Jose,
QoS & Queuing Theory CS352.
Balancing Uplink and Downlink Delay of VoIP Traffic in WLANs
IEEE e Performance Evaluation
OFDMA performance in 11ax
HCF and EDCF Simulations
Round Robin vs. Fair Queuing
TCP, XCP and Fair Queueing
QoS Tutorial Date: Authors: Nov 2008 Nov 2008
EDCF TXOP Bursting Simulation Results
CprE 458/558: Real-Time Systems
Requirements and Implementations for Intra-flow/Intra-AC DiffServ
Requirements and Implementations for Intra-flow/Intra-AC DiffServ
Provision of Multimedia Services in based Networks
Speaker:Fu-Yuan Chuang Advisor:Ho-Ting Wu Date:
Aggressiveness Protective Fair Queuing for Bursty Applications
Presented by Hermes Y.H. Liu
Simulation for EDCF Enhancement Comparison
Advanced Computer Networks
Computer Science Division
Use of EDCA Access During HCF Polling
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
EDCF Issues and Suggestions
Considerations for OBSS Sharing using QLoad Element
Power Efficiency Analysis
MAC improvement using random AIFSN
802.11e QoS Tutorial Date: Authors: Nov 2008 Nov 2008
of the IEEE Distributed Coordination Function
Student : Min-Hua Yang Advisor : Ho-Ting Wu Date :
Proposed Overlapping BSS Solution
Acknowledgement for Multicast Streams
Proposed Overlapping BSS Solution
Requirements and Implementations for Intra-flow/Intra-AC DiffServ
Uniform e Admissions Control Signaling for HCF and EDCF
Considerations for OBSS Sharing using QLoad Element
AFR partial MAC proposal for IEEE n
OFDMA performance in 11ax
Osama Aboul-Magd Nortel
Schedule Element Synchronization and Simplification
Requirements and Implementations for Intra-flow/Intra-AC DiffServ
EECS 122: Introduction to Computer Networks Packet Scheduling and QoS
802.11e QoS Tutorial Date: Authors: Oct 2008 Oct 2008
Modeling and Evaluating Variable Bit rate Video Steaming for ax
Infocom 2004 Speaker : Bo-Chun Wang
A Simple QoS Packet Scheduler for Network Routers
Presentation transcript:

A Fair Scheduling Scheme for HCF doc.: IEEE 802.11-00/457 July 2003 A Fair Scheduling Scheme for HCF Qiang Ni, Pierre Ansel, Thierry Turletti Qiang.Ni@Sophia.inria.fr Thierry.Turletti@Sophia.inria.fr INRIA Sophia Antipolis, France Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 INTRODUCTION There is a simple round-robin scheduler in 802.11e D4.2 for HCF controlled channel access mechanism We have implemented 802.11e D4.2 HCF (HCCA and EDCF) in ns (network simulator) From simulation we found such a HCF scheduler is good for periodic CBR (Constant Bit Rate) traffic, but not good for VBR (Variable Bit Rate) traffic (such as Poisson, bursty traffic) Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Simulation Topology 1: 6 QSTAs send three kinds of flow to QAP July 2003 Simulation Topology 1: 6 QSTAs send three kinds of flow to QAP Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Traffic Stream/User Priority July 2003 Simulation Parameters PHY layer: 802.11a rate 36Mbps Beacon interval: 500ms Audio: On-Off traffic, mean burst time: 400ms, mean idle time: 600ms VBR video: The VBR flows have been traced from the VIC video conferencing tool using H.261coding and QCIF format for typical “header and shoulder” video sequences (mean sending rate belongs to a window of 80Kb/s around the mean value of 200Kb/s, packet sizes of these flows belong to a large range of values between 20 and 1024bytes, and mean packet size is between 600bytes and 700bytes) CBR video: We increase the HCF load by increasing the packet size of CBR MPEG4 traffic from 600bytes (2.4Mb/s) to 1000bytes (4Mb/s) Application Inter-arrival period (ms) Packet size (bytes) Sending rate (Kb/s) Traffic Stream/User Priority Maximal SI Audio 4.7 160 64 TS6/UP6 50 VBR video 26  660  200 TS5/UP5 100 CBR video 2 600-> 1000 2400->4000 TS4/UP4 Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 The mean delay of HCF audio is almost 20ms, and that of EDCF is much smaller Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 The mean delay of HCF VBR traffic is very high (about 300ms), and that EDCF remains smaller Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 The mean delay of HCF CBR traffic is almost 60ms, and that of EDCF increase according to the rate Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

,where is the mean data sending rate July 2003 Why HCF scheduler is good for periodic CBR (Variable Bit Rate) traffic, but not good for VBR (Variable Bit Rate)? Current scheduler computes the number of packets arriving in the TS queue j of QSTA i during a SI: ,where is the mean data sending rate However, for VBR traffic, the sending rate and packet size are varying, some packets may not be transmitted during the TXOP due to a higher sending rate than that specified in the TSPEC, in this case, latency of these packets can not be controlled by the QAP and some packets maybe dropped Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

,where is the queue length at the end July 2003 Our solution First we derived a mathematic relationship between maximum delay, SI and queue length: ,where is the queue length at the end of TXOP , if , can be almost equal to SI since The QAP computes the estimated queue length at the beginning of the next SI and the ideal queue length which provides Fig. Queue length evolution for A TS: (0) ideal queue length; (1) ; (2) Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Based on the difference between ideal queue length July 2003 Our solution Based on the difference between ideal queue length and estimated queue length, the QAP calculates the additional time (positive or negative) to add to the TXOP The node scheduler recalculates the TXOP for each TS Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Simulation results July 2003 HCF FHCF FHCF EDCF EDCF Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Simulation Topology 2 July 2003 Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Simulation Parameters July 2003 Simulation Parameters Application Inter-arrival period (ms) Packet size (bytes) Sending rate (Kb/s) Maximal SI Audio 4.7 160 64 50 VBR video 26  660  200 100 CBR video 2 800 3200 Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Simulation results July 2003 Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

Number of lost packets Audio VBR CBR FHCF 204 HCF 513 EDCF 1 3 8443 July 2003 Number of lost packets Audio VBR CBR FHCF 204 HCF 513 EDCF 1 3 8443 Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 CBR Audio VBR Audio VBR CBR Qiang NI, Pierre Ansel, Thierry Turletti, INRIA

July 2003 Conclusion HCF simple scheduler is good for periodic CBR (Constant Bit Rate) traffic, but not good for VBR (Variable Bit Rate) traffic (such as Poisson, bursty traffic) We proposed a fair scheduler which uses queue length estimations to tune its time allocations to stations Simulation results show that fair scheduler provides good fairness while supporting bandwidth and delay requirements for a large of network loads Qiang NI, Pierre Ansel, Thierry Turletti, INRIA