UNIT IV 9

UDP TCP Adaptive Flow Control Adaptive Retransmission - Congestion control

Congestion avoidance QoS
QUALITY OF SERVICES (QoS):
Network so!ld s!pport m!ltimedia applications tat are tose com"ine
a!dio# video# and data$ For tat it so!ld provide s!%%icient "andwidt$ Te timeliness o%
deliver& can "e ver& important$ Te applications tat is sensitive to te timeliness o%
data as real time applications$ Te data so!ld "e delivered correctl&$ A network tat can
provide tese di%%erent levels o% services is o%ten said to "e s!pport '!alit& o% services$
APPLICATION REQUIREMENTS:
Applications are divided into two classes$ Te& are
real time
non real time te& are called as traditional data applications$
Since te& ave traditionall& "een te ma(or applications %o!nd
on data
networks$ )*amples are# Telnet# FTP# email# we" "rowsing etc$
TAXONOMY OF REAL TIME
APPLICATIONS:
Te caracteristics !sed to categori+e te applications are#
,$ Tolerance o% loss o% data
-$ Adapta"ilit&
APPROACHES TO QoS
SUPPORT:
Te approaces are divided into two "road categories$ Te& are#
,$ Fine-grained approaces# wic provide QoS to individ!al
applications o% %lows$
-$ Coarse-grained approaces# wic provides QoS to large class o% data
or aggregated tra%%ic$
.n te %irst categor&# integrated services are !sed and in te second
categor& di%%erentiated services are !sed$
INTEGRATED SERVICES
(RSVP)
Te term /.ntegrated Services0 re%ers to a "od& o% work tat was prod!ced "& te
.)TF aro!nd ,112-13$Te .ntServ working gro!p developed te speci%ications o%
a n!m"er o% service classes designed to meet te needs o% some o% te application
t&pes descri"ed a"ove$ .t also de%ined ow RS4P co!ld "e !sed to make reservations
!sing tese service classes$
SERVICE
CLASSES:
5ne o% te service classes is designed %or intolerant applications$ Tese
applications re'!ire tat a packet never arrive late$ Te network so!ld g!arantee tat te
ma*im!m dela& tat an& packet will e*perience as some speci%ied val!e6 te application
can ten set its pla&"ack point so tat no packet will ever arrive a%ter its pla&"ack time$
Te aim o% te controlled load service is to em!late a ligtl& loaded
network %or tose applications tat re'!est service# even to!g te network as a wole
ma& in %act "e eavil& loaded$ Te trick to tis is to !se a '!e!ing mecanism s!c as
7FQ to isolate
te controlled load tra%%ic %rom te oter tra%%ic and some %orm o% admission control to
limit te total amo!nt o% controlled load tra%%ic on a link s!c tat te load is kept
reasona"l& low$
OVERVIEW
OFMECHANISMS8
Te set o% in%ormation tat we provide to te network is re%erred to as a %low
spec$
7en we ask te network to provide !s wit a partic!lar service# te network
needs to decide i% it can in %act provide tat service$
Te process o% deciding wen it sa&s no is called admission control$ 7e
need a mecanism "& wic te !sers o% te network and te components o% te network
itsel% e*cange te in%ormation s!c re'!ests %or service# %low specs# and admission
control decisions$ Tis is called signaling in te AT9 world# "!t since tis word as
several meanings# we re%er to tis process as reso!rce reservation# and it is acieved !sing
a Reso!rce Reservation Protocol$
7en %lows and teir re'!irements ave "een descri"ed# and admission control
decisions ave "een made# te network switces and ro!ters need to meet te
re'!irements o% %lows$ A ke& part o% meeting tese re'!irements is managing te wa&
packets are '!e!ed and sced!led %or transmission in te switces and ro!ters$ Tis last
mecanism is packet sced!ling$
FLOWSPEC
S:
Tere are two separa"le parts to te %low spec8 te part tat descri"es te
%lows tra%%ic caracteristics and te part tat descri"es te service re'!ested %rom te network$ Te
RSpec is ver& service speci%ic and relativel& eas& to descri"e$
Te TSpec is a little more complicated$
ADMISSION
CONTROL:
7en some new %low wants to receive a partic!lar level o% service# admission
control looks at te TSpec and RSpec o% te %low and tries to decide i% te desired service
can "e provided to tat amo!nt o% tra%%ic# given te c!rrentl& availa"le reso!rces# wito!t
ca!sing an& previo!sl& admitted %low to receive worse service it ad re'!ested$ .% it
can
provide te service# te %low is admitted6 i% not ten denied$ Te ard part is %ig!ring
o!t wen to sa& &es and wen to sa& no$
Admission control is ver& dependent on te t&pe o% re'!ested service and on te
'!e!ing discipline emplo&ed in te ro!ters6 wen disc!ss te latter topic later in
tis section$ For a g!aranteed service# &o! need to ave a good algoritm to make a
de%initive &es:no decision$
RESERVATION PROTOCOL:
7ile connection oriented networks ave alwa&s needed some sort o% set!p
protocol to esta"lis te necessar& virt!al circ!it state in te switces#
connectionless networks like te internet ave ad no s!c protocols$ 7ile tere ave
"een a n!m"er o% set!p protocols p;proposed %or te internet# te one on wic most
c!rrent attention is %oc!sed is called reso!rce reservation protocol <RS4P=$
Te caracteristics o% RS4P are#
.t tries to maintain te ro"!stness "& !sing te idea o% so%t state in te
ro!ters$ .t aims to s!pport m!lticast %lows (!st as e%%ectivel& !nicast %lows$
PACKET CLASSIFYING AND SCHEDULING:
5nce we ave descri"ed o!r tra%%ic and o!r desired network service and ave
installed a s!ita"le reservation at all te ro!ters on te pat# te onl& ting tat remains
is %or te ro!ters to act!all& deliver te re'!ested service to te data packets$ Tere are
two tings tat need to "e done8
o Associate eac packet wit te appropriate reservation so tat it can "e andled
correctl&# a process known as cl!!"#$"%& 'c()*!$ .t is done "& e*amining
%ive %ields in te packet8 te so!rce address# te destination address# protocol
n!m"er# so!rce port# destination port$
o 9anage te packets in te '!e!es so tat te& receive te service tat as "een
re'!ested# a process known as 'c()* !c+),-l"%&$