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

Single mode for transmitting optical signals, Q. Single Mode for transmitti...

Q. Single Mode for transmitting optical signals? - Merely one beam from a light source is transmitted using a smaller range of angles - Smaller diameter as well as lower de

ILab 2: Office Network Expansion, #queiLab 2: Office Network Expansion Con...

#queiLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Dates for Assig

What is retransmission timer, Q. What is Retransmission timer? Retrans...

Q. What is Retransmission timer? Retransmission timer if an ACK is received previous to the timer goes off - destroy the timer if the timer goes off before ACK a

Why it is essential to have layering in a network, Q. Why it is essential t...

Q. Why it is essential to have layering in a network? Ans: A computer network is a very complicated system. It becomes very hard to implement as a single entity. The layered ap

Link layer process, Each link layer process will have two connections: one ...

Each link layer process will have two connections: one "up" to the appropriate IP layer process, and one "sideways" to the link layer process on the simulated machine at the other

Distributed data processing, In distributed data processing, explain two sc...

In distributed data processing, explain two scenarios where vertical partitioning and horizontal partitioning are used. Distributed Data Processing The distributed data pro

Circuit switched networks, Question 1 Write about                       Ci...

Question 1 Write about                       Circuit Switched Networks                       Packet Switched Networks Question 2 Write about                       Protocol Indep

My Printer, Cannot print from Computer recently

Cannot print from Computer recently

Error correction in burst error correction, Q. Error Correction in Burst Er...

Q. Error Correction in Burst Error Correction? Error Correction-Burst Error Correction In its place of sending all the bits in a data unit together we can organize "N

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