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

What do you use the aux port for, The auxiliary port is used to link a mode...

The auxiliary port is used to link a modem to for dial backups.

What is connection-oriented communication, What is Connection-oriented comm...

What is Connection-oriented communication Connection-oriented communication can be in three phases. In establishment phase a request is made to set up the connection. Only afte

Fault tree construction rules, FAULT TREE CONSTRUCTION RULES (a)  Defi...

FAULT TREE CONSTRUCTION RULES (a)  Define the  undesired  fault  condition  as the  "Top"  event. The  fault  event describes the state of either the system or a component. (b

what is sad, In IPSec what is SAD, SPD and SA's

In IPSec what is SAD, SPD and SA's?

Prepare network schema of a company, Your Case Study must be based on the i...

Your Case Study must be based on the information provided. There will be no additional information. This must be submitted in a .doc, or .pdf format. If you send a few paragraphs i

Name the categories of multiplexing, Name the categories of Multiplexing? ...

Name the categories of Multiplexing? There are three categories of multiplexing a. Frequency Division Multiplexing (FDM) b. Time Division Multiplexing (TDM)    i. Sync

Explain peer-to-peer networking model, Explain Peer-to-Peer Networking Mode...

Explain Peer-to-Peer Networking Model. A networking model where every workstation has equivalent capabilities and responsibilities is called as peer-to-peer model. There is no

What is the mac address, The address for a device as it is recognized at th...

The address for a device as it is recognized at the Media Access Control (MAC) layer in the network architecture. MAC address is usually stored in ROM on the network adapter card a

Briefly describe about cryptography, Question 1 Describe any five differen...

Question 1 Describe any five different types of computers Question 2 Explain Bus Type LAN. Its advantages and disadvantages and examples Question 3 Explain the s

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