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 IEEE 802.4-token bus, IEEE 802.4-Token bus Physical line or tree...

IEEE 802.4-Token bus Physical line or tree however logical ring. Stations know "left" as well as "right" stations. One token "passed" from station to station. Only station with

Explain the term - global corporate-wide network, Explain the term - global...

Explain the term - global corporate-wide network It would be highly interesting to note that more than 70 per cent of all security related problems start from within the organi

Explain monitor stations of token passing, Monitor Stations Lost t...

Monitor Stations Lost tokens - timer is issued each time a frame or token is generated If no frame is received in time period new token is generated by a monitor stat

Show nonreturn to zero encoding, Q. Show Nonreturn to Zero encoding? - ...

Q. Show Nonreturn to Zero encoding? - Value of signal is for all time positive or negative - NRZ-L Signal level depends on bit represented; positive typically means 0

Define carrier sense multiple access collision avoidance, Carrier Sense Mul...

Carrier Sense Multiple Access/Collision Avoidance a) Necessary since wireless LANs cannot implement CSMA/CD b) Collision detection requires increased bandwidth requirements

Why is the authentication and key agreement of 3gpp weak, Question 1: a...

Question 1: a) How is the four-way exchange employed for mutual authentication in WPA/RSN? b) Elaborate on how inquiry attacks and traffic monitoring attacks can be u

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

Message passing libraries mpi and pvm, In this part, we shall talk about ab...

In this part, we shall talk about about message passing libraries. In history, various message passing libraries have been available since the 1980s. These executions differed subs

Characteristics of the user private group scheme, Question: a) The cpi...

Question: a) The cpio utility has three operating modes. What are they? b) The characters of the permission string are broken up into three groups of three characters. Ex

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