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

8088, 8088 pin diagram

8088 pin diagram

Define the analog audio and video conferencing systems, Define the analog a...

Define the analog audio and video conferencing systems When analog audio and video conferencing systems were used, the procurement and installation was complex, less reliable a

What is bridged ethernet, Bridged Ethernet Raises bandwidth by divi...

Bridged Ethernet Raises bandwidth by dividing the network into smaller networks allowing concurrent communications Separates collision domains because traffic is lower

Explain about twisted-pair cable, Q. Explain about Twisted-Pair Cable? ...

Q. Explain about Twisted-Pair Cable? - Two conductors surrounded by insulating material - One wire utilize to carry signals and other used as a ground reference - Twistin

Determine the uses of firewalls, Determine the uses of firewalls The fi...

Determine the uses of firewalls The firewalls available today do all the things, viz., like filter the data packets, provide proxy services and do stateful inspection of packet

., Given a five station token bus LAN with station addresses of 3000, 500, ...

Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assum

Simple mail transfer protocols (smtp), Simple Mail Transfer Protocols (SMTP...

Simple Mail Transfer Protocols (SMTP) The application  layer  protocols  for electronic  mail is SMTP( Simple mail  transfer protocols). Internet  electronic  mail  has man

What are reasons behind using layered protocols, What are reasons behind us...

What are reasons behind using layered protocols  Reasons for using layered protocols, using them leads to breaking up design problem into smaller more manageable pieces and lay

Osi reference model, - The model was developed by the ISO (International Or...

- The model was developed by the ISO (International Organisation for Standardisation) in 1984. It is currently considered the primary Architectural model for inter-computer communi

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