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

asymmetric multiprocessing, Describe what is meant by Asymmetric Multiproc...

Describe what is meant by Asymmetric Multiprocessing (AMP)? Ans) It imposses hierarchy and a division of labour between processors. Only one designated processor, the master, co

Encrypt and decrypt message cryptography, Submission instructions: Answer ...

Submission instructions: Answer the following questions using a text processing software and submit your answers via connex. Possible file formats for your submission file(s) are .

Options negotiation - transport layer, Options Negotiation To use any ...

Options Negotiation To use any of the options first  requires option  negotiation between the client  and server. Four  control  characters are used for  this purpose.

What is forward error correction and data words, What is Forward Error Corr...

What is Forward Error Correction and data words Forward error correction It is the process in which the receiver tries to guess the message by using redundant bits. Da

Describe the count-to-infinity problem in distance vector, Describe the cou...

Describe the count-to-infinity problem in distance vector

Collective message passing, In collective message passing, all the processe...

In collective message passing, all the processes of a set participate in communication. MPI gives a number of functions to execute the collective message passing. Some of them are

Determine downloading time when non persistent http is used, Assume that a ...

Assume that a user wants to download from a server a web page that references 3 objects. The base page and each of the objects are of the same size that requires 20 ms transmission

Describe in a generic manner the packet of ipsec, Can you describe in a gen...

Can you describe in a generic manner the packet of IPSec

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