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

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Ans) Routable protocols can work with a router and can be used to build huge networks. Non-Routable protocol

Illustrate stop-and-wait automatic repeat request, Q. Illustrate Stop-and-W...

Q. Illustrate Stop-and-Wait Automatic Repeat request? - Simplest flow as well as error control mechanism - The sending device keeps a duplicate copy of the last frame transm

Assignment help, Hello there i have an assignment in Data communication an...

Hello there i have an assignment in Data communication and networks. I have done most of the assignment but i am stuck in one part which is designing a network in a university cam

What is a database server, With a database server, the client gives SQL req...

With a database server, the client gives SQL requests as messages to the database server. The results of every SQL command are returned over the network. The server uses its own pr

Write a descriptive note on rmonv2, Question 1 What does the SNMP access p...

Question 1 What does the SNMP access policy represent? Question 2 Does there exist any formal functional specification for SNMPv1 management? Question 3 In the con

Discuss network interface using any os, Question 1 List 10 common ActiveX ...

Question 1 List 10 common ActiveX controls Question 2 Discuss Network Interface using any OS Question 3 Explain BGP components and its working Question 4 G

Process management, Bootstrapping all the processes and establishing correc...

Bootstrapping all the processes and establishing correct lines of communication is, by itself, the toughest aspect of this assignment. Before writing any code you should think care

Name the twisted pairs cables, Name the Twisted pairs cables Twisted pa...

Name the Twisted pairs cables Twisted pairs cables (Shielded and Unshielded), Coaxial cable and Fiber optic cable. ?Testing of the points ?Testing of the entire network t

Determine three features of igrp, GRP uses a composite metric complete up o...

GRP uses a composite metric complete up of bandwidth and delay by default, it updates each 60 Seconds and will trigger an update if the topology changes.

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