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

Parallel programming environment characteristics, Parallel Programming Envi...

Parallel Programming Environment Characteristics  The parallel programming environment consists of an debugger, a editor,  performance evaluator and programme visualizer for i

Encoding data options in parallel virtual machine , Encoding data options ...

Encoding data options PVM uses SUN's XDR library to generate a machine independent data format if you request it. Settings for the encoding option are: PvmDataDefault: Use X

What is load balancing, If the number of incoming clients invokes exceeds t...

If the number of incoming clients invokes exceeds the number of processes in a server class, the TP Monitor might be dynamically start new ones and this is known as Load balancing.

Explain transparent bridges and learning bridges, Transparent Bridges & Lea...

Transparent Bridges & Learning Bridges - Builds table by examining destination as well as source address of each packet it receives - Learning bridges - If address is not

Byte number - transport layer, Byte Number TCP number all data  bytes ...

Byte Number TCP number all data  bytes that  are transmitted  in a connection. Numbering  is independent  in each direction when TCP receives bytes of data  a process. It stor

TRAFFIC CONGESTION, Can I get help for data analysis on traffic congestion ...

Can I get help for data analysis on traffic congestion using GIS

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

Need for standards, Need for standards - Over the past couple of decade...

Need for standards - Over the past couple of decades several of the networks that were built used different hardware and software implementations therefore they were incompatib

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