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

Define csma/cd, CSMA/CD - A Simple Definition A netwo...

CSMA/CD - A Simple Definition A network station wishing to broadcast will first check the cable plant to make sure that no other station is currently transmit

Undesirable sharing - fundamentals of networks, Undesirable Sharing ...

Undesirable Sharing With  the good  comes  the bad  while  networking  allow  the easy  sharing  of useful  information it also  the sharing  of undesirable  data. One sign

Explain about traffic shaping, Q. Explain about Traffic shaping ? Traf...

Q. Explain about Traffic shaping ? Traffic shaping -Method to control the amount and the rate of the traffic sent to the network.? Leaky bucket Token bucket -

How does a switch use store and forward, The LAN switch copies the whole fr...

The LAN switch copies the whole frame into its onboard buffers and then looks up the destination address in its forwarding, or switching, table and verifies the outgoing interface

What is ipv6 addressing, QUESTION (a) What are the problems with IPv4 o...

QUESTION (a) What are the problems with IPv4 on today's Internet and how does IPv6 solve these problems? (b) Describe at least three ways in which IPv6 is more efficient tha

How to identify connectivity problems- ccna, Identify Connectivity Problems...

Identify Connectivity Problems  Step 1: Use the ping command to test network connectivity. Use the following table to test the connectivity of every network device.

Metropolitan area network ( man)- fundamentals of networks , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE Metropolitan area Network ( MAN) Metropoli

Explain classification of computer network by range, Question 1 Explain cl...

Question 1 Explain classification of computer Network by range Question 2 Explain three major problems of Transmission lines Question 3 What is the maximum data rate of

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