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

Standard ip access-list use as test criteria, What does a Standard IP Acces...

What does a Standard IP Access-list use as test criteria Ans) Standard IP access list use only source address.

Networking security, difference between spambox and inbox in gmail

difference between spambox and inbox in gmail

State some security models, State some Security Models The first and f...

State some Security Models The first and foremost thing one needs to do is to chalk out a security plan and policy based on any security model. The term security policy shall

Show the bidirectional transmission, Q. Show the Bidirectional Transmission...

Q. Show the Bidirectional Transmission? Bidirectional Transmission Each party must maintain S and R to track frames sent and expected Piggybacking hooking ACK wit

State the disadvantages of ring topology, Point out the disadvantages of Ri...

Point out the disadvantages of Ring Topology. The drawbacks of ring topologies are: a. It is considerably complex to install and reconfigure ring topology b. Media failur

Explain about mesh topology, Q. Explain about Mesh Topology? - Dedicate...

Q. Explain about Mesh Topology? - Dedicated point-to-point links to each other device - n (n-1)/2 links an every device will have n-1 I/O ports - Advantages - Dedic

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

Butterfly permutation, Butterfly permutation This permutation is gettin...

Butterfly permutation This permutation is getting by interchanging the important significant bit in address with smallest significant bit.

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