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 authentication header (ah) protocol, Can you explain the Authen...

Can you explain the Authentication Header (AH) Protocol?

What are the important benefits of computer network, Q. What are the import...

Q. What are the important benefits of computer network? Ans: Important benefits of computer networks are: -  Resource sharing -  Higher reliability -  Higher flexibili

Advantages, What are advantages of having e-commerce over extranets

What are advantages of having e-commerce over extranets

Show upper layers of tcp-ip model, Q. Show Upper Layers of tcp-ip model? ...

Q. Show Upper Layers of tcp-ip model? The Session Layer - The Session layer allows two parties to hold ongoing communications called a session across a network. - Not

Prepare the network of spanning tree protocol -ccna, Prepare the Network  ...

Prepare the Network  Step 1: Disable all ports by using the shutdown command. Ensure that the initial switch port states are inactive with the shutdown command. Use the inter

Merge sort circuit, First, split the given series of n numbers into two par...

First, split the given series of n numbers into two parts, each consisting of n/2 numbers. After that, recursively split the series into two parts until each number acts as an inde

Network, network diagram which must include at least 2router,2bridge and 4 ...

network diagram which must include at least 2router,2bridge and 4 switches and must have different protocols and different cable...?

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