Computing shortest path in a graph, Computer Networking

Assignment Help:

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.

WEIGHTED GRAPH

Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:

2244_weighted graph.png

The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.

DISTANCE MATRICS

Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.


Related Discussions:- Computing shortest path in a graph

Configure spanning tree- ccna, Configure Spanning Tree Step 1: Ex...

Configure Spanning Tree Step 1: Examine the default configuration of 802.1D STP. On each switch, display the spanning tree table with the show spanning-tree command. R

Define character stuffing, Define Character Stuffing? In byte stuffing ...

Define Character Stuffing? In byte stuffing (or character stuffing), a particular byte is added to the data section of the frame when there is a character with the same pattern

Explain the communication channel threats, Q. Explain the Communication Cha...

Q. Explain the Communication Channel Threats? Secrecy Threat - Secrecy is the avoidance of unauthorized information disclosure - Privacy is the guard of individua

Explain priority and reservation of token passing, Priority and Reservation...

Priority and Reservation Higher priority stations may possibly access the token sooner Each station has a priority code Since token passes by station waiting to t

Fiber distributed data interface, Question 1 Write short notes on (i) F...

Question 1 Write short notes on (i) Fiber Distributed Data Interface (ii) Serial Line Question 2 Explain Internet layer and transport layer Internet layer Tran

Layers, Layers, Massages, Segments, Datagram's and Frames Figure 2.15 ...

Layers, Massages, Segments, Datagram's and Frames Figure 2.15 show the physical  path data takes down a  sending  end  systems  protocol  stack up and  down the  protocol stac

Global positioning system (gps) tracking, By utilizing measurements of the ...

By utilizing measurements of the so-called pseudo range between an object and each of several earth orbiting GPS satellites, the object can be very accurately located in space. A g

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd