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

Mechanical characteristics of RS232 interface, Q. Mechanical Characteristic...

Q. Mechanical Characteristics of RS232 interface? - 9-pin connector - 9-pin connector is more usually found in IBM-PC but it covers signals for asynchronous serial com

What is shielded twisted pair, Q. What is Shielded Twisted Pair? - A me...

Q. What is Shielded Twisted Pair? - A metal foil or braided-mesh covering encases every pair of insulated conductors to prevent electromagnetic noise called crosstalk - Cros

Internet backbone - computer network, Internet Backbone Internet backb...

Internet Backbone Internet backbone  is the  physical  networks ( usually relying  on fiber optic  cable ) that  carries  internet  traffic between  different  networks  and i

What is d-amps, What is D-AMPS D-AMPS uses 832 channels (in every dire...

What is D-AMPS D-AMPS uses 832 channels (in every direction) with three users sharing a sole channel. This allows D-AMPS to support up to the 2496 users simultaneously per cel

Difficulties in internetwork communication, Q. Difficulties in Internetwork...

Q. Difficulties in Internetwork Communication? - Data arrive at interface f1 of s1 - How does s1 know that they must be sent out from interface f3? - There is no provisio

Determine about the internet, Determine about the Internet The I...

Determine about the Internet The Internet as a source of information and reference material, browsing the World Wide Web (WWW) and Newsgroups for the latest gossip or sh

Recognize the command that shows the sap table, show ipx servers is the co...

show ipx servers is the command that shows the SAP table

What is a hypertext link, A hypertext link is a special tag that links sing...

A hypertext link is a special tag that links single page to another page or resource. If you click the link, the browser goes to the link's destination.

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