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

Determine the switch in a physical ring, Switch In a physical ring ...

Switch In a physical ring configuration any disabled or else disconnected node can disable the entire network Use of a switch can permit the ring to bypass an inactive

What is smtp, What is SMTP? SMTP is short for Simple Mail Transfer Proto...

What is SMTP? SMTP is short for Simple Mail Transfer Protocol. This protocol deals with all internal mail, and gives the essential mail delivery services on the TCP/IP protocol

What is meant by middleware, Middleware is distributed software required to...

Middleware is distributed software required to support interaction among clients and servers. In short, it is the software that is in the middle of the Client/Server systems and it

Show the routing table, Q. Show the Routing Table? Routing Table ...

Q. Show the Routing Table? Routing Table Every router remains a routing table that has one entry for every destination network of which the router is aware Proces

Distance vector multicast routing protocol, DVMRP • Distance vector mu...

DVMRP • Distance vector multicast routing protocol: Distance vector multicast routing protocol are abbreviated as DVMRP. These protocols are suitable for small networks which

Why congestion occurs, Q. Why congestion occurs? Congestion Emerg...

Q. Why congestion occurs? Congestion Emerge if the load on the network is greater than the capacity of the network - Load that is the number of packets sent to the net

sorting circuit along with odd-even merging circuit, As we previously know...

As we previously know, the merge sort algorithm needs two circuits, i.e. one for merging and second for sorting the sequences. Thus, the sorting circuit has been derived from the a

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