Buffer Sizing for 802.11 Based Networks

43. Buffer Sizing for 802.11 Based Networks

Abstract:-

We consider the sizing of network buffers in 802.11 based networks. Wireless networks face a number of fundamental issues that do not arise in wired networks. We demonstrate that the use of fixed size buffers in 802.11 networks inevitably leads to either undesirable channel under-utilization or unnecessary high delays. We present two novel dynamic buffer sizing algorithms that achieve high throughput while maintaining low delay across a wide range of network conditions. Experimental measurements demonstrate the utility of the proposed algorithms in a production WLAN and a lab test bed.

Existing System:-

The distribution of packet service times is also strongly dependent on the WLAN offered load. This directly affects the burstiness of transmissions and so buffering requirements.

IEEE 802.11b support up to 11 MBps, sometimes this is not enough – far lower than 100 Mbps fast Ethernet

In co-existing environment, the probability of frequency collision for one 802.11 frame vary from 48% ~62%

Disadvantages of Existing System:

n  Unaware of interference from/to other networks

n  Weak security policy

n  Poor performance (coverage, throughput, capacity, security)

n  Unstable service

n  Customer dissatisfaction

Proposed System:-

In this paper we demonstrate the major performance costs associated with the use of fixed buffer sizes in 802.11WLANs and present two novel dynamic buffer sizing algorithms that achieve significant performance gains. The stability of the feedback loop induced by the adaptation is analyzed, including when cascaded with the feedback loop created by TCP congestion control action. using the A* algorithm proposed in this paper, the RTTs observed when repeating the same experiment fall to only 90-130 ms. This reduction in delay does not come at the cost of reduced throughput, i.e., the measured throughput with the A* algorithm and the default buffers is similar in this paper is on TCP traffic since this continues to constitute the bulk of traffic in modern networks (80–90%  of current Internet traffic and also of WLAN traffic ), although we extend consideration to UDP traffic at various points during the discussion and also during our experimental tests.

Advantages of Proposed System:

                   

n  The reduction in network delay not only benefits UDP traffic, but also short-lived TCP connections

n  Comes from easy maintenance, cabling cost, working efficiency and accuracy

n  Network can be established in a new location just by moving the PCs!

Architecture:-

Algorithm Details:-

   eBDP algorithm

   Dynamic buffer sizing algorithm,

   Adaptive Limit Tuning (ALT) Feedback Algorithm

Explanation:-

The algorithms in this paper perform similarly when the DCF is used and when TCP ACKs are prioritized using the EDCA as in. Per flow behavior does, of course, differ due to the inherent unfairness in the DCF and we therefore mainly present results using the EDCA to avoid flow-level unfairness

Abbreviation

DCF-Distributed Coordinated Function (DCF)

EDCA -Enhanced distributed channel access (EDCA) ‎

MODULES:

·        Buffer Sizing

·        IEEE 802.11 Media Access Control (MAC)

·        TCP/IP packet in 802.11

·        IEEE 802.11e Simulation

·        Traffic Mix, Adaptive Limit Tuning (ALT)

Modules Description:-

1. Buffer Sizing

Buffers play a key role in 802.11/802.11e wireless networks. To illustrate this, we present measurements from the production WLAN of the Hamilton Institute, which show that the current state of the art which makes use of fixed size buffers, can easily lead to poor performance. . We recorded RTTs before and after one wireless station started to download a 37MByte file from a web-site. Before starting the download, we pinged the access point (AP) from a laptop 5 times, each time sending 100 ping packets. The RTTs reported by the ping program was between 2.6-3.2 ms. However, after starting This work is supported by Irish Research Council for Science, Engineering and Technology and Science Foundation Ireland Grant 07/IN.1/I901. the download and allowing it to continue for a while (to let the congestion control algorithm of TCP probe for the available bandwidth), the RTTs to the AP hugely increased to 2900-3400 ms. During the test, normal services such as web browsing experienced obvious pauses/lags on wireless stations using the network. Closer inspection revealed that the buffer occupancy at the AP exceeded 200 packets most of the time and reached 250 packets from time to time during the test. Note that the increase in measured RTT could be almost entirely attributed to the resulting queuing delay at the AP, and indicates that a more sophisticated approach to buffer sizing is required.

2. IEEE 802.11 Media Access Control (MAC)

Measured distribution of the MAC layer service time when there are 2 and 12 stations active. It can be seen that the mean service time changes by over an order of magnitude as the number of stations varies. Observe also from these measured distributions that there are significant fluctuations in the service time for a given fixed load. This is a direct consequence of the stochastic nature of the CSMA/CA contention mechanism used by the 802.11/802.11e MAC.

3. TCP/IP packet in 802.11

Consider a WLAN consisting of n client stations each carrying one TCP upload flow. The TCP ACKs are transmitted by the wireless AP. In this case TCP ACK packets can be easily queued/dropped due to the fact that the basic 802.11 DCF ensures that stations win a roughly equal number of transmission opportunities. Namely, while the data packets for the n flows have an aggregate n/(n + 1) share of the transmission opportunities the TCP ACKs for the n flows have only a 1/(n+1) share. Issues of this sort are known to lead to significant unfairness amongst TCP flows but can be readily resolved using 802.11e functionality by treating TCP ACKs as a separate traffic class which is assigned higher priority. With regard to throughput efficiency, the algorithms in this paper perform similarly when the DCF is used and when TCP ACKs are prioritized using the EDCA as in. Per flow behavior does, of course, differ due to the inherent unfairness in the DCF and we therefore mainly present results using the EDCA to avoid flow-level unfairness.

4. IEEE 802.11e Simulation

In this paper is on TCP traffic since this continues to constitute the bulk of traffic in modern networks (80–90%  of current Internet traffic and also of WLAN traffic), although we extend consideration to UDP traffic at various points during the discussion and also during our experimental tests.

Fig: WLAN topology used in simulations. Wired link bandwidth 100Mbps.

Compared to sizing buffers in wired routers, a number of fundamental new issues arise when considering 802.11-based networks. Firstly, unlike wired networks, wireless transmissions are inherently broadcast in nature which leads to the packet service times at different stations in a WLAN being strongly coupled. For example, the basic 802.11 DCF ensures that the wireless stations in a WLAN win a roughly equal number of transmission opportunities, hence, the mean packet service time at a station is an order of magnitude longer when 10 other stations are active than when only a single station is active. Consequently, the buffering requirements at each station would also differ, depending on the number of other active stations in the WLAN

In this paper, in addition to extensive simulation results we also present experimental measurements demonstrating the utility of the proposed algorithms in a test bed located in office environment and with realistic traffic. This latter includes a mix of TCP and UDP traffic

5. Traffic Mix, Adaptive Limit Tuning (ALT)

We configure the traffic mix on the network to capture the complexity of real networks in order to help gain greater confidence in the practical utility of the proposed buffer sizing approach.

Fig. shows example time histories of the buffer size and occupancy at the AP with a fixed buffer size of 400 packets and when the A* algorithm is used for dynamic buffer sizing. Note that in this example the 400 packet buffer never completely fills. Instead the buffer occupancy has a peak value of around 250 packets. This is due to non-congestive packet losses caused by channel noise which prevent the TCP congestion window from growing to completely fill the buffer. Nevertheless, it can be seen that the buffer rarely empties and thus it is sufficient to provide an indication of the throughput when the wireless link is fully utilized.

System Requirements:

Hardware Requirement:

v Minimum 1.1 GHz PROCESSOR should be on the computer.

v 128 MB RAM.

v 20 GB HDD.

v 1.44 MB FDD.

v 52x CD-ROM Drive.

v MONITORS at 800x600 minimum resolution at 256 colors minimum.

v I/O, One or two button mouse and standard 101-key keyboard.

 

 Software Requirement:

v   Operating System                              :  Windows 95/98/2000/NT4.0.

v    Technology                                      :  JAVA, JFC(Swing)

v    Development IDE                            :  Eclipse 3.x

REFERENCE:

Tianji Li, Douglas Leith, David Malone, “Buffer Sizing for 802.11 Based Networks”, IEEE Transactions on Networking, Vol. 19, No.1, February 2011.