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

Throughput, Throughput is a calculate of the rate at which data can be tran...

Throughput is a calculate of the rate at which data can be transmit through the network. The throughput capability of the underlying hardware is known bandwidth. Because every fram

Modern computer , modern technology in world of 21 century

modern technology in world of 21 century

Example of parallel sections construct, This example demonstrates the use o...

This example demonstrates the use of parallel sections construct. The three functions, fun1, fun2, and fun3, all can be executed concurrently.  Note that all the section directives

What are the advantages and disadvantages of routing table, What are the ad...

What are the advantages and disadvantages of the three types of routing tables? The three types of routing tables are fixed, dynamic, and fixed central. The fixed table must be

What is explicit congestion signalling, What is Explicit congestion signall...

What is Explicit congestion signalling In general way, for explicit congestion avoidance, the network alerts end systems to growing congestion within the network and the end sy

Projecr assingment, I have a project that need to be submit as soon as poss...

I have a project that need to be submit as soon as possible

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