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

What does a metric of 16 hops showwhen using RIP , Destination unreachable ...

Destination unreachable Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

State about the communications network, State about the communications netw...

State about the communications network 1) The communications network may only accept blocks of data up to a specific size.   (2) Error control might be more effective with a

Explain about the browser, Explain about the Browser A program that ...

Explain about the Browser A program that allows the user to access and read information on the World Wide Web. Netscape® Navigator and Microsoft Explorer® are the best known

In formation sharing at regular intervals, In formation  sharing at  regu...

In formation  sharing at  regular intervals For example  every 30 seconds each router sends its information  about the  whole  network  to its  neighbours. This sharing  occurs

Command to configure a explanation on an interface, Recognize the command t...

Recognize the command to configure a explanation on an interface Ans) Router(config-if)# explanation Finance department

Filtering incoming frames, FILTERING INCOMING FRAMES: An analyzer may ...

FILTERING INCOMING FRAMES: An analyzer may be configured to process and filter frames. It may count frames of a specific size or type. It may also shows only frames from or to

IPV6, is DVMRP multicast prtocol supports IPV6?

is DVMRP multicast prtocol supports IPV6?

Explain the concept of router-root path, Explain the concept of router-root...

Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa

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