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

Ipx traffic on a network, To monitor ipx traffic on a network, what command...

To monitor ipx traffic on a network, what command would we use? Ans) show ipx traffic

Process server, Using a process server (such as inetd or xinetd) to listen ...

Using a process server (such as inetd or xinetd) to listen on a set of well-popular ports and start one another server.  I said that it had much to do with overhead.  Say you set u

Merits of a network based ids and a host based ids, Question: (a) Descr...

Question: (a) Describe the following biometric techniques:- (i) Retina scan, (ii) Fingerprint, (iii) Iris Scan. Your answer should consider the following: the data storage requ

What is the client side of applications, What is the client side of applica...

What is the client side of applications To build the client side of applications, developers use various tools. Some of the popular software development environments include Vi

Maximum packet lifetime, Take the maximum packet lifetime, T.  It's stated ...

Take the maximum packet lifetime, T.  It's stated that T must be big enough to make sure the packet and its ACK have vanished.  Why do we have to have the ACK?

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

Discuss about the similarity of intranets to the internet, Discuss about th...

Discuss about the similarity of Intranets to the Internet The ease of use of the end user would be the most noticeable because of the similarity of Intranets to the Internet. S

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