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 about the gopher, Explain about the Gopher The ghoper is a prot...

Explain about the Gopher The ghoper is a protocol designed to search, retrieve and display documents from remote sites on the  Internet. The Ghoper was formed as a piece of sof

Explain communications channels, A communications channel is pathways over ...

A communications channel is pathways over which information can be communicate. It may be described by a physical wire that connects communicating devices, or by a radio, laser, or

Explain the acknowledged connectionless service, Explain the Acknowledged c...

Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

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...?

Diffuse reflection in the basic illumination model, Question: (a) By ma...

Question: (a) By making use of an example, explain the Cohen-Sutherland line clipping algorithm. (b) Compare and contrast between the CMY and RGB colour models. (c) Expla

Bit stuffing, bit stuffing program in python

bit stuffing program in python

IP address, what is variable ip address

what is variable ip address

Implement a web server on personal computer, Question: a) The Systems ...

Question: a) The Systems Administrator of Acme Company performs the backup of the website database file every day at 15:50. The original file location is database.sql. The Ad

Determine the concept of placing antenna on hieght, Determine the concept o...

Determine the concept of placing antenna on hieght First, starting deployment simply placed cells in regions where there was high density of vehicle or human population. Once t

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