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

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

Drawback of repeaters, Drawback of  Repeaters. Repeater  has no filte...

Drawback of  Repeaters. Repeater  has no filtering capability as it forwards  every frame. Repeater shell  be placed  at accurate distance  before  actual  signal becomes

Write the generic name of the osi layer, Write the Generic Name of the OSI ...

Write the Generic Name of the OSI Layer a)  The figures below illustrate, side by side, the OSI 7-layer reference model and the Internet protocol stack. Inside each box represen

Explain types of networking and internetworking device, What is the differe...

What is the different type of networking / internetworking devices? 1. Repeater: Also known as a regenerator, it is an electronic device that operates only at physical layer.

Working of TCP - buffers, Q. Working of  TCP - buffers? TCP - buffers ...

Q. Working of  TCP - buffers? TCP - buffers Sending & receiving buffers - Processes don't consume data at the same speed Sending site: - White section: unfilled

Causes of failures, CAUSES OF FAILURES Every failure has a well-define...

CAUSES OF FAILURES Every failure has a well-defined cause.  Any system or device has an inherent strength or capacity to resist failures. This depends on design, material, man

Differentiate between fast fading and slow fading, Differentiate between Fa...

Differentiate between Fast fading and Slow fading Fast fading refers to changes in signal strength among a transmitter and receiver as the distance among the two changes by a s

Explain the layer which is closer to the user, There is only an applicatio...

There is only an application layer which is closer to user and also gives many application which user directly linked.for ex:- web browser

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