Question

Figure 1: A set of intersecting rings

2. Consider a set of intersecting rings as in the following figure. Here, a small square represents a node, including nodes that can transfer packets between rings, and each ring has an arrow that indicates the direction of packet flow on that ring. Each ring is labeled by a lower case Greek letter with the first ring labeled α .

2.1. Display the adjacency matrix for the network in the figure.

2.2. Which, if any, nodes are equivalent on the network and why? (Hint: recall that equivalence in this context has to do with the number of links to a node as well as the information flow directions to and from a node.)

2.3. Which nodes, if any, represent single points of failure of the network?

2.4. Display the weight matrix for the network.

2.5. Using the Bellman-Ford algorithm, calculate a route from node S to node D on the network as displayed in Fig. 1. Show each step of the algorithm as you develop the route.

Answer 1

ot 千 3 3 6 etuuork from this cwe This is the aiven n draus noymal ho de bosed divected Names asre qtven to hodles as a mes asiegrven Where . Source D々Desh nation 3 亡

2-1. Adi acency Matrix from the giver Graph A OO1 o F|0 0 0 | 0 0 000 which ,if any, hodes one eguishlent onthe The re is no nodes are equivelent in the nedtoork

.3. khich nodes i any represent single oints 64 failure of the netoork? A Single points of failure is a past of Sqstem hod, if it fails woill stop the entire sysem from SPoP ohe unde.siysble in any syatem uoit trom working. p ohe undte.sir able in any System a good of high availability and Telabibił There is no such points in the entire System No" single points of failuve. in given nleo Wo single po 34 Weighted Matsiz of the Netuorsk o e o o 12.600 千0ood Oo C 00ぎチ00

Finding Shontest path frem S to D mdur Using Bellman-F0γd cle rithm. This algorithm弁nds Shortest path between el ventices This algorithm wonks on Rdloxing alu the adges (n) times no no of vontices Relaxㅢ ng rneans Fiisty eoe have to write al the edges Prom the Sousce to Destination Colees es-CS,A CE), E,), (EH)F,C), G,F), G,D) fiesttq distnce fron Sousce to source is o and to au ventices is 千 1 2 4 2

starts Relaxing opto (n-1) tǐnnes We have Ventices So 2 8 itenathions voe have st itenaion ㅢaking edges and telaing done in grop ao 千 3 21 2 14 | edge Relaxation İS explained here "remain au same method let edge SA SU AzV In Such a a the yelaxation happens

nd ilenction 4 26 26 5 구 3 19 - Nous caill cek r on opdations- o uD B using Relaxation formula But Evert, wertex has its oco n占hrolest dustance even afte the itenations it semain.s Same So hence the Shorbest path drom 8 to p js at Oistance and its poth is This is the Shrsest path us Bellman Ford Alasith.