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

Explain the forward congestion avoidance process, Explain the Forward conge...

Explain the Forward congestion avoidance process Notifies the user that congestion avoidance process should be initiated where applicable for traffic in the similar direction a

Common syntax of openmp, Q. Common syntax of OpenMP? Every OpenMP direc...

Q. Common syntax of OpenMP? Every OpenMP directive begins with #pragma omp. The common syntax is   #pragma omp directive-name [Set of clauses]  where omp is an OpenMP key

Circuit switched networks, Question 1 Write about                       Ci...

Question 1 Write about                       Circuit Switched Networks                       Packet Switched Networks Question 2 Write about                       Protocol Indep

Unguided media - wireless, Unguided Media: Wireless - A Wireless commu...

Unguided Media: Wireless - A Wireless communication transporting electromagnetic waves without a physical conductor Wireless Propagation Methods - Ground - radio

What is error detection, What is Error Detection? What are its methods? ...

What is Error Detection? What are its methods? Data can be corrupted during transmission. For reliable communication errors must be deducted and corrected. Error Detection uses

Explain transparent bridges and learning bridges, Transparent Bridges & Lea...

Transparent Bridges & Learning Bridges - Builds table by examining destination as well as source address of each packet it receives - Learning bridges - If address is not

What is mesh topology, What is mesh topology Mesh topology is a setup w...

What is mesh topology Mesh topology is a setup wherein every device is linked directly to each other device on the network. Consequently, it needs that each device has at least

Define power management in wireless network, Question 1 Brief the Fourth g...

Question 1 Brief the Fourth generation network. List its advantages and disadvantages Question 2 Explain the steps involved in component identification and call establishm

Cidr presentation, Inside a device, every address mask is stored as a 32-bi...

Inside a device, every address mask is stored as a 32-bit number. When we submit a prefix and an address mask they use a changed form of dotted decimal addressing known CIDR addres

Distance vector and link-state protocol, What's the difference among distan...

What's the difference among distance vector and link-state protocol?

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