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

Networking, Discuss the interdependence of networking hardware and software...

Discuss the interdependence of networking hardware and software. Is it possible to have one without the other?

Modern computer , modern technology in world of 21 century

modern technology in world of 21 century

Multiple activity charts, A multiple activity chart records the related ...

A multiple activity chart records the related sequence of activities of more than one subject, men and / or machine on a common time scale showing the relationship between

Programming based on message passing, Programming Based on Message Passing ...

Programming Based on Message Passing As we know, the programming model based on message passing uses high level programming languages like C/C++ along with a number of message

Discuss on the characteristics of agents, Question 1 Discuss on the cha...

Question 1 Discuss on the characteristics of agents 2 Belief, Desire and Intention architecture is the most popular agent architecture. Procedural Reasoning System (PRS) is

Error detecting code - parity bit, Error Detecting Code - Parity bit: ...

Error Detecting Code - Parity bit: The general idea for achieving error detection and correction is to add some redundancy (i.e., some extra data) to a message, which receiver

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