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

Authentication in ppp - point to point , Authentication in PPP PPP can ...

Authentication in PPP PPP can support  authentication operations at the  beginning of a connection. In some  cases reauthentication is also  possible  during  a session.  Endpo

My Printer, Cannot print from Computer recently

Cannot print from Computer recently

Merits of a network based ids and a host based ids, Question: (a) Descr...

Question: (a) Describe the following biometric techniques:- (i) Retina scan, (ii) Fingerprint, (iii) Iris Scan. Your answer should consider the following: the data storage requ

WOrkstation, Interdepences of workstation hardware and software

Interdepences of workstation hardware and software

Describe about the noiseless channel, Describe about the noiseless channel ...

Describe about the noiseless channel A noiseless channel can transmit an arbitrarily large amount of information, no matter how frequently it is sampled. Just send a lot of dat

Briefly describe nat and rip, Briefly describe NAT and RIP NAT is Netwo...

Briefly describe NAT and RIP NAT is Network Address Translation. This is a protocol that gives a way for multiple computers on a common network to share one connection to the I

Describe the datawarehouse and data mining, Question 1: ‘There is an ov...

Question 1: ‘There is an overwhelming imperative for organisations to analyse every bit of information they can extract from their huge data warehouses for competitive advant

Network, do you do paraphrase

do you do paraphrase

Explain logical ring physical star topology, Explain Logical Ring Physical ...

Explain Logical Ring Physical Star topology for Token-Passing Standard. It is definite that any break in the ring at any point will interrupt communications for all machines.

Different technologies involved in establishing wan links, What are the dif...

What are the different technologies involved in establishing WAN links? Analog connections - using conventional telephone lines; Digital connections - using digital-grade telep

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