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 process of piggybacking, Q. Explain the process of piggybacking...

Q. Explain the process of piggybacking? When a data frame arrives in its place of immediately sending a separate control frame and the receiver restrains itself and waits until

Mechanical characteristics of RS232 interface, Q. Mechanical Characteristic...

Q. Mechanical Characteristics of RS232 interface? - 9-pin connector - 9-pin connector is more usually found in IBM-PC but it covers signals for asynchronous serial com

What is encapsulation and de-encapsulation, Process to send data is called ...

Process to send data is called as encapsulation and process to receive data is called De-encapsulation.

Comp architecture, In reg-mem architecture, clock cycle is 10 ns wide. It i...

In reg-mem architecture, clock cycle is 10 ns wide. It is proposed that reg-reg architecture be used instead, that reduces the clock cycle by 2 ns. However, it requires an addition

Tools that an attacker can use to crack wep, Question: Consider that yo...

Question: Consider that you have to configure a small WLAN of 8 computers using Wired Equivalent Privacy (WEP) and that you have to best make use of its available security f

Describe physical layer in osi layers model, Q. Describe Physical Layer in ...

Q. Describe Physical Layer in OSI layers model? Physical Layer : Controls the transmission of the actual data onto the network. It describes the electrical signals, line state

Explain about virtual circuit switching, Q. Explain about Virtual Circuit S...

Q. Explain about Virtual Circuit Switching? Virtual Circuit Switching - All packets belong to a message (or) session is preserved. - Single route is selected between s

What are the working of software team, What are the working of software tea...

What are the working of software team The software team has to learn every bit of things related to computers. Since different users work on different platforms and application

What is load balancing, If the number of incoming clients invokes exceeds t...

If the number of incoming clients invokes exceeds the number of processes in a server class, the TP Monitor might be dynamically start new ones and this is known as Load balancing.

Matrix computation and multiplication, In the following section, we shall d...

In the following section, we shall discuss the algorithms for solving the matrix multiplication difficulty using the parallel models. Matrix Multiplication Problem Let ther

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