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

Name the two types of oltp, a) TP lite , based on stored procedures. b)...

a) TP lite , based on stored procedures. b) TP heavy , based on the TP monitors.

Explain about twisted-pair cable, Q. Explain about Twisted-Pair Cable? ...

Q. Explain about Twisted-Pair Cable? - Two conductors surrounded by insulating material - One wire utilize to carry signals and other used as a ground reference - Twistin

Program to use of lastprivate clause, This example illustrate the use of la...

This example illustrate the use of lastprivate clause void for_loop (int n, float *a, float *b) { int i; #pragma omp parallel { #pragma omp for lastprivate(i) for

Network topologies- -fundamentals of networks, Network Topologies Topo...

Network Topologies Topology is study  of the  arrangement or  mapping of  the elements links nodes etc,  of a network especially the physical and logical inter connections bet

Reliability probability of success, Reliability is the probability of succe...

Reliability is the probability of success ; where success is defined as compliance to specified requirements. A system or an item is considered reliable if it performs satisfactori

Define router. explain its type, Question 1 Define Router. Explain its typ...

Question 1 Define Router. Explain its type Question 2 List and discuss the different concepts of EIGRP Question 3 Explain the concept of autonomous system Autonomo

How firewall configuration makes all the difference, How Firewall configura...

How Firewall configuration makes all the difference The greatest blunder that any company make is to just install a firewall and think that they have ensured perfect securit

Topologies, discuss communication isolation and privatization in network to...

discuss communication isolation and privatization in network topologies

Node selection principle, QUESTION (a) Briefly describe the steps invol...

QUESTION (a) Briefly describe the steps involved in Network Simplex Method. (b) In Radix Heap Algorithm, the technique of buckets is employed. However this idea is an extens

Computer Information Systems, I am taking a computer information systems cl...

I am taking a computer information systems class for which I have an online test I need done. It will not let me attach all the material that is on the test but someone well versed

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