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

Ring token, what is logical ring maintenance and how does it work>?

what is logical ring maintenance and how does it work>?

Describe the hardware complexity of benz network, Q. Describe the Hardware ...

Q. Describe the Hardware complexity of Benz Network? Hardware complexity of Benz Network:  Benz network employs lesser switches and it gives good connectivity. To come across h

cisco ios for which encapsulation, "arpa" is used by the Cisco IOS for whi...

"arpa" is used by the Cisco IOS for which encapsulation types Ans) Ethernet_II

How do we describe the concept of dpu, How do we explain the method of DPU,...

How do we explain the method of DPU, Segments, Datagram, Frame and  packet?

Explain the term standard error, Question: a) What is a Linux shell? ...

Question: a) What is a Linux shell? b) Prepare the commands for the following tasks: i) Change the working directory ii) Show the working directory iii) Execute a pro

Networking project for 20 computers, can i get a sample networking project ...

can i get a sample networking project for 20 computer with all network components?

What is oltp, What is OLTP? In the transaction server, the client compo...

What is OLTP? In the transaction server, the client component usually contains GUI and the server components usually having of SQL transactions against a database. These applic

What is a jam signal, What is a jam signal A jam signal is broadcasts ...

What is a jam signal A jam signal is broadcasts to network by the transmitting stations that detected the collision to ensure that all stations know of the collision. Every st

Explain the technique- backpressure, Explain the technique- Backpressure ...

Explain the technique- Backpressure This technique produces an effect same to backpressure in fluids flowing down a pipe. It includes link-by-link use of flow control in a dire

Dynamic configuration and signaling, Dynamic Configuration int pvm...

Dynamic Configuration int pvm_addhosts( char **hosts, int nhost, int *infos ) Add hosts to the virtual machine. hosts is an array of strings naming the hosts to be

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