802.

11 NETWORKS BUFFER SIZING

Internal Guide Presented By

Mr. Kailash Rudra., ARUN P

Asst Professor, [4PM15SCS01]
Dept. of CS & E.,
PESITM, Shivamogga
CONTENTS
Objective
Introduction
Literature Review
Existing system
Proposed System
Algorithms
Conclusion
OBJECTIVE
we consider 802.11 based networks.

The goal is to provide Dynamic Buffer Sizing in wireless

networks to maintain high link efficiency and low delay.

We present Dynamic Buffer Sizing Algorithms.

INTRODUCTION
In networks, transmission of packets from source to
destination is through routers.

In routers memory is available for storing packets

temporarily. This memory is known as Buffer. They play a
key role in 802.11 networks.

We have
Wired network.

Wireless network.
INTRODUCTION(CONTD)
In this paper, we consider the sizing of buffers in
802.11/802.11e based WLANs.

This project involves determining buffer size which

dynamically changes according to the network
conditions.

This project incorporates algorithms to prevent delay and

loss of packets in wireless networks.

We focus on single hop.

ISSUES OF WIRELESS OVER WIRED IN BUFFER
CONCEPT
Compared to sizing buffers in wired routers, a number of
fundamental new issues arise when considering 802.11-
based networks

1. Broadcast in nature.
2. Dynamic adjustment in transmission rate.
3. Formation of large frame by aggregating packets.
LITERATURE REVIEW
The Hamilton Institute at National university
characterized Buffer Sizing for 802.11 networks.

Proposed System must have the following qualities:

Easymaintenance.
Accuracy.
Network can be established in new location just by
moving the PCs.
LITERATURE SURVEY
Sizing of buffers for voice traffic in WLANs is
investigation.

The impact of fixed buffer sizes on TCP flows.

TCP performance with a variety of AP buffer sizes and

802.11eparameter settings is investigated.

initial investigations are reported related to the eBDP

algorithm and the ALT algorithm of the A* algorithm.
ARCHITECTURE
ARCHITECTURE
EXISTING SYSTEM
In wired networks, size of the buffer is dependent on two
factors:

1. Bandwidth of the transmission link.

2. Average delay of the packet.

The product of these two factors is called as Bandwidth

delay product(BDP) .The BDP value is applicable only to
wired networks.
EXISTING SYSTEM(CONTD)
In case of wireless networks ,BDP value cannot be
applied as it is due to the following reasons:

1.No fixed number of computers.

2.Transmission happens in Broadcast mode.
PROBLEMS OF EXISTING SYSTEM

Unaware of interference from other network.

Weak security policy.
Poor performance.
Unstable service.
Customer dissatisfaction.
PROPOSED SYSTEM
If we decide buffer size early we have following issues
Buffer size very large High delay.
Buffer size is small Packets loss high.

Advantages

The reduction in network delay not only benefits UDP traffic, but
also short-lived TCP connections
Comes from easy maintenance, cabling cost, working efficiency and
accuracy
Shifting is easy, easy maintenance.
Computation is cheap and implementation on hardware is suited.
PROPOSED SYSTEM ( CONTIN)
802.11 WLANs the mean service time is generally time varying.

wireless station can measure its own packet service times by

direct observation. i.e., by recording the time between a packet
arriving at the head of the network interface queue ts and being
successfully transmitted

EBDP buffer sizing strategy depend on mean of Tserv.

we select buffer size QeBDP according to

QeBDP =min(Tmax/Tserv,Q^eBDP max )

where Q^eBDP max is the upper limit on buffer size.

Tmax target max queuing delay.
PROPOSED SYSTEM ( CONTIN)
If there are competing uploads.

we need to modify the eBDP update rule to

QeBDP = min(Tmax/Tserv +c,Q^eBDP max)

where c is an short-term fluctuations in service
rate adjustment.
ALGORITHMS USED
EBDP Algorithm(emulation Bandwidth Delay Product)
It is a simple adaptive algorithm based on the classical BDP
rule. statistical multiplexing of TCP is not present.

For example, while a buffer size of 338 packets is needed to

maximize throughput with a single download flow, this falls to
around 100 packets when 10 download flows share the link.
However, in both cases the eBDP algorithm selects a buffer
size of approximately 350
DROP TAIL OPERATION OF THE EBDP
ALGORITHM.
Set the target queuing delay Tmax.
Set the over-provision parameter c.
for each incoming packet p do
Calculate QeBDP = min(Tmax/Tserv + c,Q^eBDP max )
where Tserv is from MAC Algorithm 2.

if current queue occupancy < QeBDP then

Put p into queue
else
Drop p.
end if
end for
MAC OPERATION OF THE EBDP ALGORITHM.

Set the averaging parameter W.

for each outgoing packet p do

Record service start time ts for p.
Wait until receive MAC ACK for p, record service end time te.

Calculate service time of p: Tserv = (1 W)Tserv +

W(te ts).

end for
ALT ALGORITHM(ADAPTIVE LIMIT TUNING
FEEDBACK)

In case of ALT, buffer size dynamically varies depending

upon number of packets

Our objective is to simultaneously achieve both efficient link

utilization and low delays in the face of stochastic time
variations in the service time.

Intuitively, for efficient link utilization we need to ensure that

there is a packet available to transmit whenever the station
wins a transmission opportunity.
THE ALT ALGORITHM.

Set the initial queue size, the maximum buffer size qmax and
the minimum buffer size qmin.

Set the increase step size a1 and the decrease step size b1.

for Every t seconds do

Measure the idle time ti.
qALT = qALT + a1ti b1(t ti).
qALT = min(max(qALT , qmin), qmax)
end for
SYSTEM REQUIREMENTS
Hardware Requirements
Processor - Pentium IV 1.1 GHz
CD Drive - LG 52X
RAM - 128 MB
Hard Disk - 20 GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - 15 COLOR
Floppy Drive - 1.44 MB

Software Requirements
Language - JAVA, JFC(Swing)
Development Tool - Eclipse 3.3
Operating System - Windows 95/98/2000/NT4.0
CONCLUSION
Dynamic Buffer Sizing algorithms will play an
important role in determining Buffer size for 802.11
networks.

It ensures high utilization of wireless link and avoids

unnecessary long queuing delays.
THANK
YOU