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

What is the network router, It's a Hybrid device that joins the features of...

It's a Hybrid device that joins the features of both bridges and routers.

Assignment, i want to make the assignment from you

i want to make the assignment from you

Clos network, Clos network This network was organized by Clos (1953).  ...

Clos network This network was organized by Clos (1953).  It is a non-blocking network and gives full connectivity like crossbar network but it also requires significantly minim

Describe flow and error control mechanisms, Q. Describe Flow and Error Cont...

Q. Describe Flow and Error Control Mechanisms? Flow and Error Control Mechanisms - Stop and Wait ARQ - Go-Back ARQ - Selective Repeat ARQ

Two types of transmission technology , What are the two types of Transmissi...

What are the two types of Transmission Technology available in ccna? Ans) Point - to - Point and Broadcast are the Two types of Transmission Technology available in CCNA

Running netware 4.11 and you cant commune with your router, You are a syst...

You are a system administrator on a NetWare network, you are running  NetWare 4.11 and you cannot commune with your router. What do think what problem is? Ans)NetWare 4.11 defau

Bandwidth allocation , Consider figure.  Assume a new flow E is added that ...

Consider figure.  Assume a new flow E is added that takes a path from R1 to R2 to R6. How does the max-min bandwidth allocation change for the 5 flows?

Define the analog audio and video conferencing systems, Define the analog a...

Define the analog audio and video conferencing systems When analog audio and video conferencing systems were used, the procurement and installation was complex, less reliable a

Processor arrangements-array, Processor Arrangements It is a very frequ...

Processor Arrangements It is a very frequent event in data parallel programming to group a number of processors to perform definite tasks. To reach this goal, HPF gives a direc

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