Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Exam (elaborations)

CS6250 Computer Networks Exam 1 Questions And Answers

Rating
-
Sold
-
Pages
17
Grade
A+
Uploaded on
10-03-2025
Written in
2024/2025

CS6250 Computer Networks Exam 1 Questions And Answers CS6250 Computer Networks Exam 1 Questions And Answers CS6250 Computer Networks Exam 1 Questions And Answers

Institution
CS6250 Computer Networks
Course
CS6250 Computer Networks

Content preview

CS6250 Computer Networks Exam 1
Questions And Answers
●kDescribekthekrelationshipskbetweenkISPs,kIXPs,kandkCDNs.k-kCORRECTkkANSWER-
ThekInternetkiskakcomplexkecosystem.kItkiskbuiltkwithkaknetworkkofknetworks.kTheseknetwork
skincludek(ISPs)kInternetkServicekProviders,k(IXPs)kInternetkExchangekPoints,k(CDNs)kCon
tentkDeliverykNetworks.kInk2019,ktherekwerekapx.k500kIXPskaroundkthekworld.

largekscalekTier-
1kISPskthatkoperatekatkakglobalkscale,kandkessentiallyktheykformkthek"backbone"knetworkkov
erkwhichksmallerknetworkskcankconnect

IXPskarekinterconnectionkinfrastructures,kwhichkprovidekthekphysicalkinfrastructure,kwherek
multipleknetworksk(egkISPskandkCDNs)kcankinterconnectkandkexchangektrafficklocally.

CDNskareknetworkskthatkarekcreatedkbykcontentkproviderskwithkthekgoalkofkhavingkgreaterkc
ontrolkofkhowkthekcontentkiskdeliveredktokthekend-
users,kandkalsoktokreducekconnectivitykcosts.kSomekexamplekCDNskincludekGooglekandkN
etflix.kTheseknetworkskhavekmultiplekdatakcentersk-
kandkeachkonekofkthemkmaykbekhousingkhundredskofkserversk-

kthatkarekdistributedkacrosskthekworld.




●kExplainkAdditivekIncrease/MultiplicativekDecreasek(AIMD)kinkthekcontextkofkTCP.k-
kCORRECTkkANSWER-

TCPkdecreaseskthekwindowkwhenktheklevelkofkcongestionkgoeskbykhalvingkthekwindowksize,
kandkitkincreaseskthekwindowkwhenktheklevelkofkcongestionkgoeskdownkbykaddingktokthekwin

dowksize.kThiskcauseskconvergencektokthekoptimalkbandwidthkbykquicklykcuttingkusekinktime
skofkcongestionkwhilekslowlykincreasingkutilizationkwhenkthekcongestionkclears.

ThekideakbehindkadditivekincreasekisktokincreasekthekwindowkbykonekpacketkeverykRTTk(Ro
undkTripkTime).

OncekTCPkRenokdetectskcongestion,kitkreduceskthekratekatkwhichktheksenderktransmits.kSo,
kwhenkthekTCPksenderkdetectskthatkaktimeoutkoccurred,kthenkitksetskthekCongestionWindow

k(cwnd)ktokhalfkofkitskpreviouskvalue.




●kExplainkhowkTCPkCUBICkworks.k-kCORRECTkkANSWER-
CUBICkuseskakcubedkpolynomialkaskitskgrowthkfunction.kTokmaintainkthekTCPkfairnesskitkus
eskakmultiplicativekdecreasekandkreduceskthekwindowktokhalf.

,TCPkCUBICkiskfairkregardlesskofkRTTkbecausekthekcalculationkthatkiskusedkdependskonkthek
elapsedktimekfromktwokcongestionkevents,kratherkthankbeingkdependentkonkthekRTTkofkakco
nnection.

●kExplainkTCPkthroughputkcalculation.k-kCORRECTkkANSWER-Thekcalculationkis:
Pk=kProbabilitykofkpacketkloss
MSSk=kMaximumkSegmentkSize
RTTk=kRound-TripkTimes
BWk=kdatakperkcyclek/ktimekperkcycle
BWk=kMSS/RTTk*kCk/ksqrt(P)

●kHowkdoeskakhostkinferkcongestion?k-kCORRECTkkANSWER-
Thekhostkinferkcongestionkfromktheknetworkkbehaviorkmainlykthroughk2ksignals:
Firstkiskthekpacketkdelay.kAsktheknetworkkgetskcongested,kthekqueueskinkthekrouterkbufferskb
uildkup.kThiskleadsktokincreasedkpacketkdelays.kThus,kankincreasekinkthekround-
tripktime,kwhichkcankbekestimatedkbasedkonkACKs,kcankbekankindicatorkofkcongestionkinkthek
network.kHowever,kitkturnskoutkthatkpacketkdelaykinkaknetworkktendsktokbekvariable,kmakingk
delay-basedkcongestionkinferencekquitektricky.

Anotherksignalkforkcongestionkiskpacketkloss.kAsktheknetworkkgetskcongested,krouterskstartk
droppingkpackets.kNotekthatkpacketskcankalsokbeklostkduektokotherkreasonsksuchkaskroutingk
errors,khardwarekfailure,kTTLkexpiry,kerrorkinktheklinks,korkflowkcontrolkproblems,kalthoughkitk
iskrare.

●kHowkdoeskakroutekserverkwork?k-kCORRECTkkANSWER-Akroutekserver:
●kCollectskandkshareskroutingkinformationkfromkitskpeerskorkparticipantskthatkconnectskwithk
(i.e.kIXPkmemberskthatkconnectktokthekRS).
●kExecuteskitskownkBGPkdecisionkprocesskandkalsokre-
advertisekthekresultingkinformationk(I.e.kbestkroutekselection)ktokallkRS'skpeerkrouters.
●kAlsokknownkaskMulti-lateralkBGPkpeerksessions.

●kHowkdoeskakrouterkusekthekBGPkdecisionkprocessktokchoosekwhichkroutesktokimport?k-
kCORRECTkkANSWER-

Thekrouterkcompareskrouteskbykgoingkthroughkaklistkofkattributeskandkchooseskthekpathkwithk
theklowestkamountkofkhops,kinktheksimplestkscenario.kThekrouterkuseskakdecisionktoolkcalledk
LocalPrefkattributekwhichkiskthekpreferredkrouteklearnedkthroughkakspecifickASkoverkotherkA
Ses.kAnkASkrankskrouteskbykfirstkpreferringkthekroutesklearnedkfromkitskcustomers,kthenkthek
routesklearnedkfromkitskpeers,kandkfinallykfromkthekroutesklearnedkfromkitskproviders.kAnoth
erkattributekthatkcankaffectkroutingkdecisionskiskthekMEDk(Multi-
ExitkDiscriminator)kattribute.kThiskiskusedkbykASeskconnectedkbykmultipleklinksktokdesignate
kwhichkofkthoseklinkskarekpreferredkforkinboundktraffic.




●kHowkdoeskakTCPksenderklimitktheksendingkrate?k-kCORRECTkkANSWER-
TCPkuseskakcongestionkwindowkwhichkisksimilarktokthekreceivekwindowkusedkforkflowkcontro
l.kItkrepresentskthekmaximumknumberkofkunacknowledgedkdatakthatkaksendingkhostkcankhav
ekinktransitk(sentkbutknotkyetkacknowledged).

, TCPkuseskakprobe-and-
adaptkapproachkinkadaptingkthekcongestionkwindow.kUnderkregularkconditions,kTCPkincrea
seskthekcongestionkwindowktryingktokachievekthekavailablekthroughput.kOncekitkdetectskcon
gestionkthenkthekcongestionkwindowkiskdecreased.

Inkthekend,ktheknumberkofkunacknowledgedkdatakthatkaksenderkcankhavekiskthekminimumkofk
thekcongestionkwindowkandkthekreceivekwindow.

●kHowkdoeskankASkdeterminekwhatkrulesktokimport/export?k-kCORRECTkkANSWER-
ASkbusinesskrelationshipskdrivekankAS'kroutingkpolicieskandkinfluencekwhichkrouteskankASk
needsktokimportkorkexport.

Therekarek3kselectivektransitkroutes:kTransitkcustomerkroutes,kTransitkProviderkRoutes,kPe
erkRoutes.kThekmainkrulekiskfinancialkincentive.kTransitkcustomerkroutesk>kpeerkroutesk>ktra
nsitkproviderkroutes.

Similarlykaskexporting,kASeskarekselectivekaboutkwhichkroutesktokimportkbased,kprimarily,ko
nkwhichkneighboringkASkadvertiseskthemkandkwhatktypekofkbusinesskrelationshipkiskestablis
hed.kAnkASkreceiveskroutekadvertisementskfromkitskcustomers,kproviderskandkpeers.
WhenkankASkreceiveskmultiplekroutekadvertisementsktowardsktheksamekdestination,kfromk
multiplekASes,kthenkitkneedsktokrankkthekrouteskbeforekselectingkwhichkonektokimport.kThekr
outeskthatkarekpreferredkfirstkarekthekcustomerkroutes,kthenkthekpeerkrouteskandkfinallykthekp
roviderkroutes.kThekreasoningkbehindkthiskrankingkiskthatkankAS...
1.kwantsktokensurekthatkroutesktowardskitskcustomerskdoknotktraversekotherkASeskunnecess
arilykgeneratingkcosts,
2.kuseskroutesklearnedkfromkpeersksincekthesekarekusuallyk"free"k(underkthekpeeringkagree
ment),
3.kandkfinallykresortsktokimportkroutesklearnedkfromkproviderskaskthesekwillkaddktokcosts.

●kHowkdoeskpoisonkreverseksolvekthekcount-to-infinitykproblem?k-kCORRECTkkANSWER-
Calledkpoisonkreverse:ksincekzkreacheskxkthroughky,kzkwillkadvertisektokykthatkthekdistancekto
kxkiskinfinityk(Dz(x)=infinity).kHoweverkzkknowskthatkthiskisknotktruekandkDz(x)=5.kzktellskthiskli

ektoky,kasklongkaskitkknowskthatkitkcankreachktokxkviaky.kSincekykassumeskthatkzkhasknokpathkto
kxkexceptkviaky,kitkwillkneverksendkpacketsktokxkviakz.

Sokzkpoisonskthekpathkfromkzktoky.

●kIskTCPkfairkinkthekcasekwherektwokconnectionskhavektheksamekRTT?kExplain.kDifferentkR
TT?k-kCORRECTkkANSWER-InkTCP,kfairnesskmeans:kforkk-
connectionskpassingkthroughkonekcommonklinkkwithkcapacitykRkbps,keachkconnectionkgetsk
ankaveragekthroughputkofkR/k
IfktwokconnectionskhavektheksamekRTTkthenkthekthroughputkforkeachkshouldksumkupktokR.
SincekTCPkrelieskonkacknowledgementskofkreceivedkpackets,kRTTk(roundktripktime)kaffects
kthekconnectionkspeed.kInkAIMD,kakconnectionkwithkakfasterkRTTkwouldkbekablektokrampkfast

erkthankanotherkconnectionkwithkslowerkRTT.
(altkanswer)

Written for

Institution
CS6250 Computer Networks
Course
CS6250 Computer Networks

Document information

Uploaded on
March 10, 2025
Number of pages
17
Written in
2024/2025
Type
Exam (elaborations)
Contains
Questions & answers

Subjects

$16.49
Get access to the full document:

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF


Also available in package deal

Thumbnail
Package deal
Packaging deal for Computer Networking Final exam review Questions And Answers
-
8 2025
$ 43.76 More info

Get to know the seller

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
Academichour Arizona State University - West Campus
View profile
Follow You need to be logged in order to follow users or courses
Sold
4
Member since
1 year
Number of followers
0
Documents
980
Last sold
2 months ago
ACADEMIC HOUR

In this Platform we offer all study materials test banks, Solution Manuals HESI, ATI ETC...........

5.0

4 reviews

5
4
4
0
3
0
2
0
1
0

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions