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 the terms unicasting and multiccasting, Define the terms Unicasting,...

Define the terms Unicasting, Multiccasting and Broadcasting? If the message is sent from a source to a one destination node, it is called Unicasting. If the message is sent

System analysis, explain the appropriateness of economic and behavioral fea...

explain the appropriateness of economic and behavioral feasibility

Why is the authentication and key agreement of 3gpp weak, Question 1: a...

Question 1: a) How is the four-way exchange employed for mutual authentication in WPA/RSN? b) Elaborate on how inquiry attacks and traffic monitoring attacks can be u

Leased satellite channel, LEASED SATELLITE CHANNEL: It may span arbitr...

LEASED SATELLITE CHANNEL: It may span arbitrarily big distance. It is given in the figure below.   Figure Satellite connections are low bandwidth to protect cost

What are the main differences between ripv1 and ripv2, 1.  What does RIP st...

1.  What does RIP stand for? 2.  What metric does RIP use for Path Selection? 3.  If the metric used by RIP exceeds this value for a route it is considered unreachable, effec

Determine the disadvantages of socks protocol, Determine the disadvantages ...

Determine the disadvantages of SOCKS protocol The main problem with SOCKS is that it lacks transparency to software developers and users. Implementation requires a change to

Determine about the security systems, Determine about the Security Systems ...

Determine about the Security Systems If the company intends to connect to the Internet, then it should pay great attention to the configuration of firewalls. Just as no one wo

Networking concepts and applications, iLab 2: Office Network Expansion ...

iLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Da

How can data to be exchanged between networks, Q. How can data to be exchan...

Q. How can data to be exchanged between Networks? Internetwork Links in an internetwork

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