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

Cdma gsm back haul network, S t d "B" 6.4 m Ku-BAND EARTH STATION (2004) ...

S t d "B" 6.4 m Ku-BAND EARTH STATION (2004)   D-Sat (District Satellite Project) circuits for rural connectivity via satellite are in operation. Purpose of this project i

What are ip addresses, What are IP addresses? IP address refers to the ...

What are IP addresses? IP address refers to the name of a computer on a network, like the Internet. An Identifier for a computer or device on a TCP/IP network, like the

What is meant by asymmetric multiprocessing (amp), It imposes hierarchy and...

It imposes hierarchy and a division of labor between processors. Only one designated processor, the master, controls (in a tightly coupled arrangement) slave processors dedicated t

Describe the steps involved in network simplex method, QUESTION 1: (a) ...

QUESTION 1: (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of the abov

Packets in eigrp, What are different kinds of packets in EIGRP?

What are different kinds of packets in EIGRP?

Illustrate go back - N protocol, Q. Illustrate Go Back - N protocol? G...

Q. Illustrate Go Back - N protocol? Go Back - N - Sender window size - Receiver window size = 1 - Why the names go back- N? - When the frame is spoilt the sende

Show concept of permutation network, Q. Show Concept Of Permutation Network...

Q. Show Concept Of Permutation Network? In permutation interconnection networks the information transfer necessitates data transfer from input set of nodes to output set of nod

Error and flow control in dll, differntiate between error control and flow...

differntiate between error control and flow control in data link layer

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