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 is multistation access unit, Multistation Access Unit (MAU) C...

Multistation Access Unit (MAU) Combines individual automatic switches May perhaps daisy chain to support more stations

What is error detection, What is Error Detection? What are its methods? ...

What is Error Detection? What are its methods? Data can be corrupted during transmission. For reliable communication errors must be deducted and corrected. Error Detection uses

Advantage and disadvantage of wiring schemes, ADVANTAGE AND DISADVANTAGE OF...

ADVANTAGE AND DISADVANTAGE OF WIRING SCHEMES:  Each of three wiring procedure has disadvantages and advantages, which are illustrate as follows: RELIABILITY ISSUES:  W

Explain clustering support, Explain clustering support Clustering suppo...

Explain clustering support Clustering support refers to the ability of a network operating system to link multiple servers in a fault-tolerant group. The main purpose of this i

Describe about radio waves, Radio Waves - Frequency ranges: 3 KHz to 1...

Radio Waves - Frequency ranges: 3 KHz to 1 GHz - Omni directional - Susceptible to interference by other antennas utilizing same frequency or band - Ideal for long-di

Explain short term and medium-term scheduling, What are short, long and med...

What are short, long and medium-term scheduling? Long term scheduler verifies which programs are admitted to the system for processing. It controls the degree of multiprogrammi

Which applications of computer network will be categorized, Q. What are the...

Q. What are the main categories based on which applications of computer network will be categorized? Ans: The main areas under which the applications for computer network will

Parallel construct in openmp, Parallel Construct The syntax of the para...

Parallel Construct The syntax of the parallel construct is as follows: #pragma omp parallel [set of clauses]  where clause is one of the following:  structured-block if(sca

What is redundancy, What is Redundancy? The method of including extra i...

What is Redundancy? The method of including extra information in the transmission solely for the purpose of comparison. This technique is known as redundancy.

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