Question

For the network given in the following diagram, show how the link-state algorithm builds the routing table for node x. Construct and fill the table as given below: Page 2 of 4 Iteration Initial 1 2 3 4 5 6 8

Answer 1

ہوم پزشکی کرکینگ اولین بار ماثيلها عنك لن تحریک رنگبنگہدالله بركاته لاک لتأكيد لا يحرجنگ نرمیدم للكتلگرسنهور) بلحه کلیک در مهدکوددهی بالتولگيدلة بعل) دلاورا كثرة التفكيهعهه گهر) لاله گهگمتابعه یا گرنگهایتینگ اہتمالا دلم(مهم) داکوتولهه) المكينهرلبلبلاگ دغه راباك) ( مدرسه رC در محله 02 C در 6 کاره 45 دلار 3 ) (ار(1)

The first Step us an initializata am Lealt cola Step. The currently Path flow & to with directly attached 16,3 neighbors, w,yu respectively dia is not to 1 Cost from * to w from x to y is set to be from x to v is set to Gha Cost from x to t, & tos, X to z infinity as they are not directly linked ention N0039 Pcs BCOPCT) scw pew Dew Powe 3 6 х Now, cal culate Shortest path from X to u, x to u. D(TO, PIE) HOW Ach) Dcus, Aculo cus, pus Dig, fly teation NDCS), PCS) 3x 6x q 2,6 2 IX

Olaia al دان le cost Poll of remaining ati Houthu Despre DOT RETS/Dw, frw/ Tous w DW), Piwo Dry, Pays co 8 3, vo 3 tha about oblado the least Cast Path in Skep 3 Lad is conside the constnew we alotermine the last cost Path of Se mining Vertical Hauph y DES, PCS) | DCT,AD faw, Pow use xwo, Pews ogs, Pya Suz, Pez) 3,8 1, X 1. 2 4.9 7, y 17,4 xwvy

​​​​​​

the above table wo do love Nocle have Haloolt Sot step w Les sortida u cletamine the least cost. of Amining ustisel tasuth Deso, pess/ DTTS, POT) / She, aw pows, pous Dow, Pow/ Drgs, Pry) DEZ, PC2) 6,x Path 8 8 3 17,4 4 ab obsove that node t have the least cost path in steps to let's Dn the above table Consider verter t.

of remaining Matices to the Jess, ecos Derspor) Draw poslou, sows Pows Day, says Dezo. Prz) bix 6x 8 8 xwv 4 front xweyu wa oblove that node t halle the least coast Path on steps, so, los's the above table. Conido Vetert Tudna manjo Chid CDT Dog, Pry DIZO PIZ) proposta DCS3, PCSO 3,8 o 18/8/8 3.1 3v 3: 17 y 17, y 7it 7, u S' su Ix weye Xwvyut bit

Mode least cost Path in steple, 3 hale Jobe Sue Oble Isols Dey pry 2, PCSO DOT, PETO DEwry hus, PUD Dow) Pows! DO 3,8 b, x b. Xw Xwu 12,4 su xes hale the last cost Path in sepz, 8 Obscue thod elle consider vertexz. IDCU), Plus Drys, Pay Drzo,P(-2) Irso, peso DID, PITO Dru), Pous Dodom لیا را الأحد 3,0 5 مبارک zit 7+ bet Xavy xweynt xwvyuts Xwvyutsz 8

I am trying to solve your query in detail. I hope you like it and if you want further help then please comment.