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

Define routing, Define Routing? The process of determining systematical...

Define Routing? The process of determining systematically hoe to forward messages toward the destination nodes based on its address is known as routing.

Create and simulate a network - netml system, Create and simulate a network...

Create and simulate a network similar to the one shown here, using the NetML system. The network is a little more complex, as depicted at the right. There is an extra node

Define the bulletin board intranet, Define the Bulletin Board Intranet ...

Define the Bulletin Board Intranet This type of Intranet in an organisation extends to everyone the capability to review or update information that would normally be placed

Matlab chi square functioning, Create a custom chi-square function in matla...

Create a custom chi-square function in matlab, MATLAB in Statistics

State the nonselective fading and selective fading, Nonselective fading and...

Nonselective fading and Selective fading Nonselective fading, is a fading in which all frequency methods of the received signal fluctuate in the similar proportions simultaneo

8088, 8088 pin diagram

8088 pin diagram

Why congestion occurs, Q. Why congestion occurs? Congestion Emerg...

Q. Why congestion occurs? Congestion Emerge if the load on the network is greater than the capacity of the network - Load that is the number of packets sent to the net

Configure the physical topology- ccna, Configure the Physical Topology ...

Configure the Physical Topology Step 1: Cable the network. Refer to the figure and table below for the essential cables. Step 2: Physically connect lab devices. C

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