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 the types of performance of computer hardware, State the types of per...

State the types of performance of computer hardware The hardware, i.e., the server or computer has a direct relationship on performance in the following areas: Reliabili

Des key, Assume the following 64-bit DES key (expressed in hexadecimal): FE...

Assume the following 64-bit DES key (expressed in hexadecimal): FEFE FEFE FEFE FEFE (a) What is the term for such a key? (b) State the value of each of the 48-bit round keys

What are the threats include in computer software, What are the threats inc...

What are the threats include in computer software The second component vulnerable to threats to the system is software. Threats to software may include, but are not limited to

What is forest, The term "forest" is used to explain a collection of AD dom...

The term "forest" is used to explain a collection of AD domains that share a one schema for the AD. All DC's in the forest share this schema and it is replicated in a hierarchical

Describe about the server and browser software, Describe about the Server a...

Describe about the Server and browser software Most of the server and browser software developed by various vendors carry out encryption using either a 40-bit or a 128-bit sec

Router share information in distance vector routing, Explain how does route...

Explain how does router share information in Distance Vector routing?

Command structure in distributed enrollment protocol , Command Structure: ...

Command Structure: Commands are all-upper-case strings, either 4 or 6 characters in length. Table 1 shows the commands, and (for method commands) the parameters, return values, ex

Uneven load distribution, Uneven Load Distribution In the parallel com...

Uneven Load Distribution In the parallel computer, the problem is dividing into sub-problems and is assigned for computation to various processors. But sometimes the sub-probl

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