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

Single mode for transmitting optical signals, Q. Single Mode for transmitti...

Q. Single Mode for transmitting optical signals? - Merely one beam from a light source is transmitted using a smaller range of angles - Smaller diameter as well as lower de

State the disadvantages of ring topology, Point out the disadvantages of Ri...

Point out the disadvantages of Ring Topology. The drawbacks of ring topologies are: a. It is considerably complex to install and reconfigure ring topology b. Media failur

Write the statement which is true regarding full duplex, Allows for transmi...

Allows for transmission and receiving of data concurrently

Reliable data transfer over a perfectly reliable channel r, Reliable  dat...

Reliable  data transfer  over a perfectly reliable channel rdt 1.0 First  all consider  the simplest  care in  which  the underlying  channel  perfectly reliable.  The protoco

What is the attenuation, In communication weakening or loss of signal energ...

In communication weakening or loss of signal energy, typically caused by distance

Explain fdm and tdm with example, Question 1 Explain FDM and TDM with exam...

Question 1 Explain FDM and TDM with example Question 2 Define B-ISDN and explain its services Question 3 What is symmetric key cryptography? Describe one symmetric

Osi reference model - fundamentals of networks, OSI Reference  Model ...

OSI Reference  Model Normal 0 false false false EN-IN X-NONE X-NONE

What are the control frames for lost tokens, Control Frames for Lost Tokens...

Control Frames for Lost Tokens If station goes down ... token lost Predecessor listens for data frame or token Noticing none, retransmits token Sends whofoll

Reliable data transfer - transport layer, Reliable Data Transfer Figur...

Reliable Data Transfer Figure illustrate the  framework for reliable  transfer. The service  abstraction provided  to the upper  layer  entities is that  of a reliable channel

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