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

Show the character-level encryption, Q. Show the Character-level Encryption...

Q. Show the Character-level Encryption? - Substitutional - Monoalphabetic - simplest form; also called Caesar cipher - Every character is replaced with another character

What is multistation access unit, Multistation Access Unit (MAU) C...

Multistation Access Unit (MAU) Combines individual automatic switches May perhaps daisy chain to support more stations

Explain linear array interconnection networks, Linear Array: This is a most...

Linear Array: This is a most basic interconnection pattern. Processors are connected in a linear one-dimensional array. The first as well as last processors are attached with one a

Define about unix systems and windows servers, What protocol can be applied...

What protocol can be applied when you need to transfer files between different platforms, such among UNIX systems and Windows servers? Use FTP (File Transfer Protocol) for file

Example on multiplicative decrease, Q. Example on Multiplicative Decrease? ...

Q. Example on Multiplicative Decrease? w = 1 for (each new ACK received) w = w+1 until (loss detected or w >= ssthresh) Not so slow - Exponential increase

Determine the working of lan within a corporate network, Determine the work...

Determine the working of LAN within a corporate network It should be very clear right from the beginning that a firewall is not simply for protecting a corporate network from u

What is the virtual path, Along any transmission path from a given source t...

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is known as path.

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