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

Explain the term- encryption, Explain the term- Encryption Because all ...

Explain the term- Encryption Because all of the user traffic, as well as control traffic, is digitized in second generation systems, it is a relatively simple matter to encrypt

Name the twisted pairs cables, Name the Twisted pairs cables Twisted pa...

Name the Twisted pairs cables Twisted pairs cables (Shielded and Unshielded), Coaxial cable and Fiber optic cable. ?Testing of the points ?Testing of the entire network t

Diffrence between network vs internet layers, Q. Diffrence between Network ...

Q. Diffrence between Network vs Internet Layers? - Similar to all the other OSI Layers the network layer provides both connectionless and connection-oriented services. From th

What is transmission media, Q. What is Transmission Media? - Actually s...

Q. What is Transmission Media? - Actually situated below the physical layer - Directly controlled through the physical layer - Data should be converted into electromagnet

What are reasons behind using layered protocols, What are reasons behind us...

What are reasons behind using layered protocols  Reasons for using layered protocols, using them leads to breaking up design problem into smaller more manageable pieces and lay

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

What is a database server, With a database server, the client gives SQL req...

With a database server, the client gives SQL requests as messages to the database server. The results of every SQL command are returned over the network. The server uses its own pr

Connectionless service, In connectionless schema, there is no connection re...

In connectionless schema, there is no connection required. The source of data includes destination information in data and transmit to the network. Network transmit each data item

Use of two-layer switch, Q. Use of Two-Layer Switch? - Performs at the ...

Q. Use of Two-Layer Switch? - Performs at the physical as well as data link layer - A bridge with many ports designed for faster performance - Allocates unique port to ea

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