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

Advantages of mobile wireless network, Advantages of mobile wireless networ...

Advantages of mobile wireless network over a wired network is it is very much popular, it is very easy to set up, it requires a simple plug and the speed and reliability is very

Arrays pointers for parallel algorithms, Arrays Pointers An array is a ...

Arrays Pointers An array is a set of the same type of data. Arrays are very well-liked data structures in parallel programming due to their easiness of use and declaration. At

Use of coaxial cable, Has a central core conductor covered in an insulating...

Has a central core conductor covered in an insulating sheath encased in an outer conductor of metal foil  RG numbers indicate physical specs such as thickness and type of insula

Network design, Get the network design for a company

Get the network design for a company

Minimum possible response time , Consider the similar conditions as the las...

Consider the similar conditions as the last problem, except for the following: what's the minimum possible response time for the 1 Gbps and a 1 Mbps line?  What does the diffrentia

Discuss the interdependence of networking hardware, Discuss the interdepend...

Discuss the interdependence of networking hardware and software. Is it possible to have one without the other? Explain

Describe some common threats to the hardware, Describe some common threats ...

Describe some common threats to the hardware Theft of a computer, printer, or other resources. Tampering by a disinterested or frustrated employee who takes every chan

Show the seven layers of iso''s osi model, Q. Show the seven layers of ISO'...

Q. Show the seven layers of ISO's OSI model? Ans:- The seven layers are given below:   -  Application Layer -  Presentation Layer -  Session Layer -  Transport Laye

Show the character-level encryption, Q. Show the Character-level Encryption...

Q. Show the Character-level Encryption? - Substitutional - Monoalphabetic - simplest form; also called Caesar cipher - Every character is replaced with another character

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