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 about error detection, Q. Explain about Error Detection? Data c...

Q. Explain about Error Detection? Data can be corrupted during transmission because of accidents, Storms, sudden increase in electricity and voltage / decrease in signal power

Spanning tree protocol - ccna, Perform Basic Switch Configurations Step...

Perform Basic Switch Configurations Step 1: Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has

Shared programming using library routines, Shared Programming Using Library...

Shared Programming Using Library Routines The most well-liked of them is the use of combo function called fork() and join(). Fork() function is used to make a new child proces

Security control procedures , a) An Introduction/Overview of Network Securi...

a) An Introduction/Overview of Network Security issues. b) A Risk Assessment  analysis- to include:             Assets                                                         T

TCP, TCP creates a reliable data transfer service, in addition to IP''s unr...

TCP creates a reliable data transfer service, in addition to IP''s unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP

Framing, different framing methods

different framing methods

Torus, Torus The mesh network with enclose around connections is called...

Torus The mesh network with enclose around connections is called Tours Network.

Discuss the architecture and applications of e-mail, Question 1 Discuss th...

Question 1 Discuss the following Switching Mechanisms- Circuit switching Message switching Packet switching   Question 2 Discuss the following IEEE standard

Single program multiple date in parallel virtual machine, Single Program Mu...

Single Program Multiple Date A common style of writing data parallel programs for MIMD computers is SPMD (single program, multiple data): all the processors implement the same

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