Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

U$ T !

User %ata&ram Protoco' UDP is not reliable n case of checksum error or data&ram dropped in the network t is not retransmitted UDP Datagram has length The 'en&th of the data is passed a'on& with the data so it has record boundaries un'ike the TCP which does not ha(e boundaries Provides a connectionless service $o 'on& term re'ationship between the c'ient and the ser(er

Transmission Contro' Protoco' )eature of Transmission Contro' Protoco' Connections : Pro(ides connection between c'ients and ser(ers Reliability *cknow'ed&e re+uired when data is sent o(er the network f acknow'ed&ement not recei(ed , TCP automatica''- retransmits the data U%P not re'iab'e

TCP )'ow Contro' Uses a form of sliding window Differs from mechanism used in LLC, HDLC, X.25, and others: Decou les ac!nowledgement of recei"ed data units from granting ermission to send more #C$%s flow control is !nown as a credit allocation scheme:

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

&ach transmitted octet is considered to ha"e a se'uence num(er TCP .eader )ie'ds for )'ow Contro' )e'uence num(er *)+, of first octet in data segment -c!nowledgement num(er *-+, .indow *., -c!nowledgement contains -+ / i, . / 0: 1ctets through )+ / i 2 3 ac!nowledged $ermission is granted to send . / 0 more octets, i.e., octets i through i 4 0 2 3 TCP Credit *''ocation /echanism

Credit *''ocation is )'e0ib'e )u ose last message 5 issued was -+ / i, . / 0

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

#o increase credit to ! *! 6 0, when no new data, 5 issues -+ / i, .

/! #o ac!nowledge segment containing m octets *m 7 0,, 5 issues -+ / i 4 m, . / 0 m

)'ow Contro' Perspecti(es

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Credit Po'ic 8ecei"er needs a olic9 for how much credit to gi"e sender Conser"ati"e a roach: grant credit u to limit of a"aila(le (uffer s ace :a9 limit through ut in long2dela9 situations 1 timistic a roach: grant credit (ased on e; ectation of freeing s ace (efore data arri"es "ffect of 1indow Si2e . / #C$ window si<e *octets, 8 / Data rate *( s, at #C$ source D / $ro agation dela9 *seconds, -fter #C$ source (egins transmitting, it ta!es D seconds for first octet to arri"e, and D seconds for ac!nowledgement to return #C$ source could transmit at most 28D (its, or 8D=> octets $orma'i2ed Throu&hput S 3 ) / >.=8D . 7 8D = > 1indow Sca'e Parameter . 6 8D = >

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Comp'icatin& )actors :ulti le #C$ connections are multi le;ed o"er same networ! interface, reducing 8 and efficienc9 ?or multi2ho connections, D is the sum of dela9s across each networ! lus dela9s at each router @f source data rate 8 e;ceeds data rate on one of the ho s, that ho will (e a (ottlenec! Lost segments are retransmitted, reducing through ut. @m act de ends on retransmission olic9 Retransmission Strate& #C$ relies e;clusi"el9 on ositi"e ac!nowledgements and retransmission on ac!nowledgement timeout #here is no e; licit negati"e ac!nowledgement 8etransmission re'uired when: )egment arri"es damaged, as indicated (9 chec!sum error, causing recei"er to discard segment )egment fails to arri"e Timers - timer is associated with each segment as it is sent @f timer e; ires (efore segment ac!nowledged, sender must retransmit Ae9 Design @ssue:

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

"alue of retransmission timer #oo small: man9 unnecessar9 retransmissions, wasting networ! (andwidth #oo large: dela9 in handling lost segment Two Strate&ies #imer should (e longer than round2tri dela9 *send segment, recei"e ac!, Dela9 is "aria(le Strate&ies: ?i;ed timer -da ti"e Prob'ems with *dapti(e Scheme $eer #C$ entit9 ma9 accumulate ac!nowledgements and not ac!nowledge immediatel9 ?or retransmitted segments, can%t tell whether ac!nowledgement is res onse to original transmission or retransmission +etwor! conditions ma9 change suddenl9 *dapti(e Retransmission Timer -"erage 8ound2#ri #ime *-8##, A43 -8##*A 4 3, / 3 B 8##*i, A43 i/3 / A43 A -8#*A, 4 A43 3 8##*A 4 3,

R)C 343 "0ponentia' *(era&in& )moothed 8ound2#ri #ime *)8##, )8##*A 4 3, / C D )8##*A, 4 *3 C, D )8##*A 4 3,

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

#he older the o(ser"ation, the less it is counted in the a"erage. R)C 343 Retransmission Timeout 8#1*A 4 3, / :in*U5, :a;*L5, E D )8##*A 4 3,,, U5, L5: rechosen fi;ed u &;am le "alues for C, E: F.G 7 C 7 F.H 3.I 7 E 7 2.F er and lower (ounds

@m lementation $olic9 1 tions )end Deli"er -cce t @n2order @n2window 8etransmit ?irst2onl9 5atch indi"idual -c!nowledge immediate cumulati"e TCP Con&estion Contro' D9namic routing can alle"iate congestion (9 s reading load more e"enl9 5ut onl9 effecti"e for un(alanced loads and (rief surges in traffic Congestion can onl9 (e controlled (9 limiting total amount of data entering networ! @C:$ source Juench message is crude and not effecti"e 8)K$ ma9 hel (ut not widel9 im lemented TCP Con&estion Contro' is %ifficu't

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

@$ is connectionless and stateless, with no ro"ision for detecting or controlling congestion #C$ onl9 ro"ides end2to2end flow control +o coo erati"e, distri(uted algorithm to (ind together "arious #C$ entities TCP )'ow and Con&estion Contro' #he rate at which a #C$ entit9 can transmit is determined (9 rate of incoming -CAs to re"ious segments with new credit 8ate of -c! arri"al determined (9 round2tri ath (etween source and destination 5ottlenec! ma9 (e destination or internet )ender cannot tell which 1nl9 the internet (ottlenec! can (e due to congestion TCP Se&ment Pacin&

TCP )'ow and Con&estion Contro'

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Retransmission Timer /ana&ement #hree #echni'ues to calculate retransmission timer *8#1,: 8## Kariance &stimation &; onential 8#1 5ac!off Aarn%s -lgorithm RTT !ariance "stimation 56acobson7s *'&orithm8 I sources of high "ariance in 8## @f data rate relati"e low, then transmission dela9 will (e relati"el9 large, with larger "ariance due to "ariance in ac!et si<e Load ma9 change a(ru tl9 due to other sources $eer ma9 not ac!nowledge segments immediatel9 6acobson7s *'&orithm )8##*A 4 3, / *3 g, D )8##*A, 4 g D 8##*A 4 3, )&88*A 4 3, / 8##*A 4 3, )8##*A,

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

)D&K*A 4 3, / *3 h, D )D&K*A, 4 h DL)&88*A 4 3,L 8#1*A 4 3, / )8##*A 4 3, 4 f D )D&K*A 4 3, g / F.325 h / F.25 f / 2 or f / > *most current im lementations use f / >, Two 9ther )actors Maco(son%s algorithm can significantl9 im ro"e #C$ erformance, (ut: .hat 8#1 to use for retransmitted segmentsN -+).&8: e; onential 8#1 (ac!off algorithm .hich round2tri sam les to use as in ut to Maco(son%s algorithmN -+).&8: Aarn%s algorithm

"0ponentia' RT9 :ackoff @ncrease 8#1 each time the same segment retransmitted (ac!off rocess :ulti l9 8#1 (9 constant: 8#1 / ' D 8#1 ' / 2 is called (inar9 e; onential (ac!off 1hich Round;trip Samp'es< @f an ac! is recei"ed for retransmitted segment, there are 2 ossi(ilities: -c! is for first transmission -c! is for second transmission #C$ source cannot distinguish 2 cases +o "alid wa9 to calculate 8##: ?rom first transmission to ac!, or ?rom second transmission to ac!N =arn7s *'&orithm Do not use measured 8## to u date )8## and )D&K Calculate (ac!off 8#1 when a retransmission occurs Use (ac!off 8#1 for segments until an ac! arri"es for a segment that has not (een retransmitted

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

#hen use Maco(son%s algorithm to calculate 8#1

1indow /ana&ement )low start D9namic window si<ing on congestion ?ast retransmit ?ast reco"er9 Limited transmit S'ow Start awnd / :@+O credit, cwndP where awnd / allowed window in segments cwnd / congestion window in segments credit / amount of unused credit granted in most recent ac! cwnd / 3 for a new connection and increased (9 3 for each ac! recei"ed, u to a ma;imum

"ffect of S'ow Start

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

%-namic 1indow Si2in& on Con&estion - lost segment indicates congestion $rudent to reset cwsd / 3 and (egin slow start rocess :a9 not (e conser"ati"e enough: Q eas9 to dri"e a networ! into saturation (ut hard for the net to reco"erR *Maco(son, @nstead, use slow start with linear growth in cwnd

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

''ustration of S'ow Start and Con&estion *(oidance

)ast Retransmit 8#1 is generall9 noticea(l9 longer than actual 8## @f a segment is lost, #C$ ma9 (e slow to retransmit #C$ rule: if a segment is recei"ed out of order, an ac! must (e issued immediatel9 for the last in2order segment ?ast 8etransmit rule: if > ac!s recei"ed for same segment, highl9 li!el9 it was lost, so retransmit immediatel9, rather than waiting for timeout )ast Reco(er .hen #C$ retransmits a segment using ?ast 8etransmit, a segment was assumed lost Congestion a"oidance measures are a ro riate at this oint &.g., slow2start=congestion a"oidance rocedure #his ma9 (e unnecessaril9 conser"ati"e since multi le ac!s indicate segments are getting through ?ast 8eco"er9: retransmit lost segment, cut cwnd in half, roceed with linear increase of cwnd #his a"oids initial e; onential slow2start

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

>imited Transmit @f congestion window at sender is small, fast retransmit ma9 not get triggered, e.g., cwnd / I Under what circumstances does sender ha"e small congestion windowN @s the ro(lem commonN @f the ro(lem is common, wh9 not reduce num(er of du licate ac!s needed to trigger retransmitN >imited Transmit *'&orithm )ender can transmit new segment when I conditions are met: #wo consecuti"e du licate ac!s are recei"ed Destination ad"ertised window allows transmission of segment -mount of outstanding data after sending is less than or e'ual to cwnd 42 Performance of TCP o(er *T/ How (est to manage #C$%s segment si<e, window management and congestion controlS Sat the same time as -#:%s 'ualit9 of ser"ice and traffic control olicies #C$ ma9 o erate end2to2end o"er one -#: networ!, or there ma9 (e multi le -#: L-+s or .-+s with non2-#: networ!s

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Effects of Congestion

Congestion-Control Mechanisms Backpressure Request from destination to source to reduce rate Useful only on a logical connection basis Requires hop-by-hop flow control mechanism Measuring and restricting packets as they enter the network Specific message back to source !g!" #CMP Source $uench Source detects congestion from transmission delays and lost ac!ets and reduces flo"

Policing Choke packet

#mplicit congestion signaling

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

E# licit congestion signaling

?rame 8ela9 reduces networ! o"erhead (9 im lementing sim le congestion2notification mechanisms rather than e; licit, er2 "irtual2circuit flow control. ?rame 8ela9 t9 icall9 is im lemented on relia(le networ! media, so data integrit9 is not sacrificed (ecause flow control can (e left to higher2la9er rotocols. ?rame 8ela9 im lements two congestion2notification mechanisms: ?orward2e; licit congestion notification *?&C+, 5ac!ward2e; licit congestion notification *5&C+,

?&C+ and 5&C+ each is controlled (9 a single (it contained in the ?rame 8ela9 frame header. #he ?rame 8ela9 frame header also contains a Discard &ligi(ilit9 *D&, (it, which is used to identif9 less im ortant traffic that can (e dro ed during eriods of congestion. #he % C& bit is art of the -ddress field in the ?rame 8ela9 frame header. #he ?&C+ mechanism is initiated when a D#& de"ice sends ?rame 8ela9 frames into the networ!. @f the networ! is congested, DC& de"ices *switches, set the "alue of the framesT ?&C+ (it to 3. .hen the frames reach the destination D#& de"ice, the -ddress field *with the ?&C+ (it set, indicates that the frame e; erienced congestion in the ath from source to destination. #he D#& de"ice can rela9 this information to a higher2la9er rotocol for

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

rocessing. De ending on the im lementation, flow control ma9 (e initiated, or the indication ma9 (e ignored. #he B C& bit is art of the -ddress field in the ?rame 8ela9 frame header. DC& de"ices set the "alue of the 5&C+ (it to 3 in frames tra"eling in the o osite direction of frames with their ?&C+ (it set. #his informs the recei"ing D#& de"ice that a articular ath through the networ! is congested. #he D#& de"ice then can rela9 this information to a higher2la9er rotocol for rocessing. De ending on the im lementation, flow2control ma9 (e initiated, or the indication ma9 (e ignored. )rame Re'a- %iscard "'i&ibi'it#he 'iscard ligibility (' ) bit is used to indicate that a frame has lower im ortance than other frames. #he D& (it is art of the -ddress field in the ?rame 8ela9 frame header. D#& de"ices can set the "alue of the D& (it of a frame to 3 to indicate that the frame has lower im ortance than other frames. .hen the networ! (ecomes congested, DC& de"ices will discard frames with the D& (it set (efore discarding those that do not. #his reduces the li!elihood of critical data (eing dro ed (9 ?rame 8ela9 DC& de"ices during eriods of congestion. )rame Re'a- "rror Checkin& ?rame 8ela9 uses a common error2chec!ing mechanism !nown as the cyclic redundancy check (CRC). #he C8C com ares two calculated "alues to determine whether errors occurred during the transmission from source to destination. ?rame 8ela9 reduces networ! o"erhead (9 im lementing error chec!ing rather than error correction. ?rame 8ela9 t9 icall9 is im lemented on relia(le networ! media, so data integrit9 is not sacrificed (ecause error correction can (e left to higher2la9er rotocols running on to of ?rame 8ela9. Traffic /ana&ement Considerations in Con&ested $etwork ? Some

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

?airness Karious flows should QsufferR e'uall9 Last2in2first2discarded ma9 not (e fair Jualit9 of )er"ice *Jo), ?lows treated differentl9, (ased on need Koice, "ideo: dela9 sensiti"e, loss insensiti"e ?ile transfer, mail: dela9 insensiti"e, loss sensiti"e @nteracti"e com uting: dela9 and loss sensiti"e 8eser"ations $olicing: e;cess traffic discarded or handled on (est2effort (asis )rame Re'a- Con&estion Contro' :inimi<e frame discard :aintain Jo) * er2connection (andwidth, :inimi<e mono oli<ation of networ! )im le to im lement, little o"erhead :inimal additional networ! traffic 8esources distri(uted fairl9 Limit s read of congestion 1 erate effecti"el9 regardless of flow Ha"e minimum im act other s9stems in networ! :inimi<e "ariance in Jo)

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Con&estion *(oidance with "0p'icit Si&na'in& #wo general strategies considered: H9 othesis 3: Congestion alwa9s occurs slowl9, almost alwa9s at egress nodes forward e; licit congestion a"oidance H9 othesis 2: Congestion grows "er9 'uic!l9 in internal nodes and re'uires 'uic! action (ac!ward e; licit congestion a"oidance "0p'icit Si&na'in& Response $etwork Response each frame handler monitors its 'ueuing (eha"ior and ta!es action use ?&C+=5&C+ (its some=all connections notified of congestion User 5end;s-stem8 Response recei t of 5&C+=?&C+ (its in frame 5&C+ at sender: reduce transmission rate ?&C+ at recei"er: notif9 eer *"ia L-$? or higher la9er, to restrict flow

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

)rame Re'a- Traffic Rate /ana&ement Parameters Committed @nformation 8ate *C@8, -"erage data rate in (its=second that the networ! agrees to su ort for a connection Data 8ate of User -ccess Channel *-ccess 8ate, ?i;ed rate lin! (etween user and networ! *for networ! access, Committed 5urst )i<e *5c, :a;imum data o"er an inter"al agreed to (9 networ! &;cess 5urst )i<e *5e, :a;imum data, a(o"e 5c, o"er an inter"al that networ! will attem t to transfer

Re'ationship of Con&estion Parameters

@9S

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

ncreased %emands +eed to incor orate (urst9 and stream traffic in #C$=@$ architecture @ncrease ca acit9 ?aster lin!s, switches, routers @ntelligent routing olicies &nd2to2end flow control :ulticasting Jualit9 of )er"ice *Jo), ca a(ilit9 #rans ort rotocol for streaming Resource Reser(ation ; Unicast $re"ention as well as reaction to congestion re'uired Can do this (9 resource reser"ation Unicast &nd users agree on Jo) for tas! and re'uest from networ! :a9 reser"e resources 8outers re2allocate resources @f Jo) not a"aila(le, ma9 wait or tr9 at reduced Jo) Resource Reser(ation ? /u'ticast Uenerate "ast traffic High "olume a lication li!e "ideo Lots of destinations Can reduce load )ome mem(ers of grou ma9 not want current transmission QChannelsR of "ideo )ome mem(ers ma9 onl9 (e a(le to handle art of transmission 5asic and enhanced "ideo com onents of "ideo stream 8outers can decide if the9 can meet demand Resource Reser(ation Prob'ems on an nternet :ust interact with d9namic routing 8eser"ations must follow changes in route )oft state a set of state information at a router that e; ires unless refreshed &nd users eriodicall9 renew resource re'uests Resource ReSer!ation Protoco' 5RS!P8 %esi&n Aoa's &na(le recei"ers to ma!e reser"ations

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Different reser"ations among mem(ers of same multicast grou allowed Deal gracefull9 with changes in grou mem(ershi D9namic reser"ations, se arate for each mem(er of grou -ggregate for grou should reflect resources needed #a!e into account common ath to different mem(ers of grou 8ecei"ers can select one of multi le sources *channel selection, Deal gracefull9 with changes in routes 8e2esta(lish reser"ations Control rotocol o"erhead@nde endent of routing rotocol RS!P Characteristics Unicast and :ulticast )im le; Unidirectional data flow )e arate reser"ations in two directions 8ecei"er initiated 8ecei"er !nows which su(set of source transmissions it wants :aintain soft state in internet 8es onsi(ilit9 of end users $ro"iding different reser"ation st9les Users s ecif9 how reser"ations for grou s are aggregated #rans arent o eration through non28)K$ routers )u ort @$"> *#o) field, and @$"V *?low la(el field, %ata )'ows ; Session Data flow identified (9 destination 8esources allocated (9 router for duration of session Defined (9 Destination @$ address Unicast or multicast @$ rotocol identifier #C$, UD$ etc. Destination ort :a9 not (e used in multicast )'ow %escriptor 8eser"ation 8e'uest ?low s ec Desired Jo)

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Used to set arameters in node%s ac!et scheduler )er"ice class, 8s ec *reser"e,, #s ec *traffic, ?ilter s ec )et of ac!ets for this reser"ation )ource address, source rot Treatment of Packets of 9ne Session at 9ne Router

RS!P 9peration %ia&ram

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

RS!P 9peration U3, U2, UI mem(ers of multicast grou )3, )2 sources transmitting to that grou Hea"9 (lac! line is routing tree for )3, hea"9 gre9 line for )2 -rrowed lines are ac!et transmission from )3 *(lac!, and )2 *gre9, -ll four routers need to !now reser"ation s for each multicast address 8esource re'uests must ro agate (ac! through routing tree )i'terin& UI has reser"ation filter s ec including )3 and )2 U3, U2 from )3 onl9 8I deli"ers from )2 to UI (ut does not forward to 8> U3, U2 send 8)K$ re'uest with filter e;cluding )2 U3, U2 onl9 mem(ers of grou reached through 8> 8> doesn%t need to forward ac!ets from this session 8> merges filter s ec re'uests and sends to 8I 8I no longer forwards this session%s ac!ets to 8> Handling of filtered ac!ets not s ecified Here the9 are dro ed (ut could (e (est efforts deli"er9 8I needs to forward to UI )tores filter s ec (ut doesn%t ro agate it Reser(ation St-'es Determines manner in which resource re'uirements from mem(ers of grou are aggregated 8eser"ation attri(ute 8eser"ation shared among senders *shared, Characteri<ing entire flow recei"ed on multicast address -llocated to each sender *distinct, )imultaneousl9 ca a(le of recei"ing data flow from each sender )ender selection List of sources *e; licit, -ll sources, no filter s ec *wild card, Reser(ation *ttributes and St-'es 8eser"ation -ttri(ute

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

Distinct )ender selection e; licit / ?i;ed filter *??, )ender selection wild card / none )hared )ender selection e; licit/ )hared2e; licit *)&, )ender selection wild card / .ild card filter *.?,

1i'd Card )i'ter St-'e )ingle resource reser"ation shared (9 all senders to this address @f used (9 all recei"ers: shared i e whose ca acit9 is largest of resource re'uests from recei"ers downstream from an9 oint on tree @nde endent of num(er of senders using it $ro agated u stream to all senders .?*WXJY, W / wild card sender J / flows ec -udio teleconferencing with multi le sites )i0ed )i'ter St-'e Distinct reser"ation for each sender &; licit list of senders ??*)3XJZY, )2XJ2Y,S, Kideo distri(ution Shared "0p'icit St-'e )ingle reser"ation shared among s ecific list of senders )&*)3, )2, )I, SXJY, :ulticast a lications with multi le data sources (ut unli!el9 to transmit simultaneousl9 RS!P Protoco' /echanisms #wo message t9 es 8es"

Code&name of the sub: CS2302& computer networks Unit: !

R/TP/02 SSU" C R"!:0#0

1riginate at multicast grou recei"ers $ro agate u stream :erged and ac!et when a ro riate Create soft states 8each sender -llow host to set u traffic control for first ho $ath $ro"ide u stream routing information @ssued (9 sending hosts #ransmitted through distri(ution tree to all destinations RS!P .ost /ode'

Summary 8)K$ is a trans ort la9er rotocol that ena(les a networ! to ro"ide differentiated le"els of ser"ice to s ecific flows of data. 1stensi(l9, different a lication t9 es ha"e different erformance re'uirements. 8)K$ ac!nowledges these differences and ro"ides the mechanisms necessar9 to detect the le"els of erformance re'uired (9 different a li2cations and to modif9 networ! (eha"iors to accommodate those re'uired le"els. 1"er time, as time and latenc92sensiti"e a lications mature and roliferate, 8)K$Ts ca a(ilities will (ecome increasingl9 im ortant