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

Explain in brief -ring topolgy, Explain in brief -Ring Topolgy Comments 1 ...

Explain in brief -Ring Topolgy Comments 1 - A faulty connection amid two stations can cause network failure 2 - It's difficult to add a new station/device as it has to come betwe

Cloud computing, Ask questiXYZ, is Pakistani company which is selling toys ...

Ask questiXYZ, is Pakistani company which is selling toys in all the major cities of Pakistan having 50 outlets in different cities. The company has the revenue of 10000000/- PKR p

How to protect computer hardware by threats, How to protect computer Hardwa...

How to protect computer Hardware by threats The first component in the computer system vulnerable to attacks or threats, and most important to be protected, is the hardware.

Network Fundamental and Routing, I Have an exam Questions and i would like ...

I Have an exam Questions and i would like it to be answered. Thanks

When a switch is said to be congested, When a switch is said to be congeste...

When a switch is said to be congested? It is possible that a switch receives packets faster than the shared link can accommodate and keeps in its memory, for an extended period

Explain the Physical layer, Explain the Physical layer The Physical lay...

Explain the Physical layer The Physical layer of the OSI model sets standards for sending and receiving electrical signals among devices. It explains how digital data (bits) ar

Describe unbound transmission media, Describe unbound transmission media. ...

Describe unbound transmission media. Unbound transmission media are the media of transmitting data without using any cables. These are not bounded by any physical geography. Ex

#tit, objective practical questios answers

objective practical questios answers

Define tp monitor, There is no commonly accepted meaning for a TP monitor. ...

There is no commonly accepted meaning for a TP monitor. According to Jeri Edwards' a TP Monitor is "an OS for transaction processing".

Explain bus topology, Explain Bus Topology. The physical Bus topology i...

Explain Bus Topology. The physical Bus topology is the easiest and most widely used of the network designs. It having of one continuous length of cable (trunk) and a terminatin

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