QUALITY OF SERVICE

Definition
QOS is an internet Working Issue Which can
be defined as flow which is required for
communication.
In any Multimedia application audio/video
Pakets are delay Sensitive Bt by internet all
packets are Treated equally (íe) QoS
offered is same for all applications.This
causes congestion in traffic follwed by
delay and loss of packets.
Analysing Various networks
Scenarios principles of QoS needed
for multimedia applications are
derived
Flow characteristics
Realibility
Delay
Jitter
Bandwith
Techniques to improve QoS
 Scheduling
 Trafficshaping
 Resource reservation
 Admission controll
Scheduling

 Packets from Different flow

arrive at Router (Switch) for
Processing.
Scheduling Treats different flow in
fair & Appropriate manner
FIFO Queuing

 FIFO means First In First Out

 Pactets wait in queue (buffer) until
processer (Router) is ready to process
them.
 If average arrival rate is higher than
average processing rate,then queue will
fill up and new packets will be discarded
Diagram:
Priority Queuing

 Packets are assigned to priority class.

 Each priority class has it’s own queue.
 Packets in high priority queue are
processed first.
 Packets in low priority queue are
processed Last.
Diagram:
Weighted fair queuing
 Packets are assigned to different class and
admitted to different queues.
 Weights are assigned to queue based on their
priority.
 System process packets of each queue in
round robin fashion with number of packets
selected from each queue based on weight.
 If system does not impose priority on
classes,then all weights will be equal.
Diagram:
Leaky bucket algorithm
 Leaky bucket i.e. a bucket with a small hole in
the bottom is used to store the water.
 The outflow from hole is at constant rate and
irrespective of rate of entering water.Once the
bucket is full,any additional water entering it
spills over the sides and is lost.
 The same idea can be applied to packets.This is
similar to a single server queueing system with
constant service time.
 Each host is connected to network
with a finite internal queue.The host
is allowed to put one packet per
second on to the network.
 If a packet arrives at the queue when
it is full, the packet is dicarded.
Diagram
Drawbacks

 The main drawbacks of Leaky bucket

algorithm is that the Output pattern
cannot be modified i.e busty traffic
arrives the output Should speedup, so
that no packets Will be lost.
Token bucket algorithm

 Token bucket algorithm eliminates the

drawbacks of Leaky bucket algorithm.
 In this leacky buckets holds tokens.
 These tokens are generated by a clock at
the rate of one token for every ∆T Sec.In
token bucket burst of upto n packets can
be sent at once, Which gives faster
response to sudden burst of input.
 Ifthe bucket is already fill of tokens,
incoming tokens overflow and are not
available of future packets.Thus ,at
anytime,the largest burst a source can
send into the network is roughly
proportional to the size of the leaky
bucket.
 The regular delays a packet if does
not have sufficient number of tokens
for transmission.
Diagram
A counter keeps track of tokens,the
counter is incremented by one every
∆T and decremented by one whenever
a packet is sent.
 When the counter hits zero,no packets
may be sent.Smoother traffic can be
obtained by putting leaky bucket after
the token bucket