Question

CSCI 101 Here is a simple heuristic (approximation algorithm) for routing a message from node A to node B in a reasonable amount of time. The algorithm assumes that every node in the network has at least two outgoing links. (2 points) 8. Assume A has n outgoing links, n 2 2, with delays to the nodes on the other end of a1, a2, an. Select the link with the shortest delay and send the message on that line. If the message arrives at node B, you are done. Otherwise, repeat this process until the message does arrive at its intended destination, but do not send the message directly back to the node from where it just came. That is, if the message was sent from A to C, then C should not return the message to A. In this case, choose the second-lowest delay value for the outgoing line. Will this heuristic always deliver the message from node A to node B8? If not, explain why by providing an example network where this heuristic does not work.

Answer 1

Solu on..- as.mple heyT.st.c fOY ^sou ㅏỉnt a a ซeasonable amount of time "the algos, thm assume that eveTY node in the Netuwosk messae oom node A to node in Routin ina messoje th lowes? delay Routing sending a message Poom ene nade to anothes a me ssage -) semple hey n'st.c method (qPPocfnnatfon alojnİthm) helps to send a message to the destnation a easnabl amount of ime. o t hiansfers the messagt fsom ane node to another de based on the owes cos of the ink foexample: Considet thwwok and Send h message km node A tnode c 13 2 2 .3 0 Set node A as sarsce and as destinat oo cost ofk A s 5 Cost of the nk A s3 oït selects the Lowes-cast 18nk A-)p to toa ns fev4h4 message to desinaton because the coS s 3

Wnk fm node F to node cn c s Isansfea sed from noâe p to node un .Cos of he link c's the destinaHO node. o so, the total Co艹of the lpnk's 、3 (3+3+2 choosng the lVnt foom AB o ?t selects he LowesCost nk 3 to tsansfes the messoge to destaton because the coss. O Thexe are tuv out the Lowest cos t l0nk pse cps the destinat n node o so, the tota , cost ofthe lont's q15+2 +2) Choos ,ㅏ selects the lowes to destinatPon be caue te cosi 9s o thexe are three ouigis om node o to nodes A.c and e s teans fesved fevm node D to nodee because the lowes o Coins three outJoing nks to node.s c. 8 and D

0 Link to c contains a Lowesi an cthe destinatPa noke h en compa fy ње above țhre e paths, Ње tast path A-)p takes ve owed cas to each the destination o rhe Shostes pth h Lowes Cospatfoom the soune rode A message CƠTTee1th to the des)?r atRon ' selects the node dependinq on the louest Cost Rak ttanser messnge soft leads to infase epeパtfon of loop o fos elample , cons aev the above conf臼«Tatton o assume casa solme node and Aasa dest%,afon node 0 these axe rous cos of the lin c-en 92 t sele45 the Lowes; eosi link C-->t toキsansfty the mess"Ж to desHnateon because the cos ㅏpsi there are outgrg k m nedc e gh the node, aes om

so, 9-doesn Select the tink £-3c Next Loenk Is -D there axe thugsnde o. CoS of the link oA to the no de toanyfes rom message doesn+ 3o cstoakgh o So,?t-does nıf select the l-t D-t the back ainto E and so on e cu cles γ(peated %,th。 cite between O Hev stic Sends a message to the des inalion C ThS Heurs tů doesn't วัeac.h e desinat on and.r ερ de lTver the matm source to stinaton