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 hardware cost, Hardware Cost It indicates to the cost ...

Hardware Cost It indicates to the cost concerned in the functioning of an interconnection network. It comprises the cost of arbiter unit, connectors, switches, interface logic

Calculate the peak-to-peak voltage of the signal, A multimeter is used to m...

A multimeter is used to measure a sinusoidal signal and reads 2V RMS; what is the peak-to-peak voltage of the signal? A mark will be deducted if you do not quote your answer to 2 s

What are the threats include in computer software, What are the threats inc...

What are the threats include in computer software The second component vulnerable to threats to the system is software. Threats to software may include, but are not limited to

Discuss network interface using any os, Question 1 List 10 common ActiveX ...

Question 1 List 10 common ActiveX controls Question 2 Discuss Network Interface using any OS Question 3 Explain BGP components and its working Question 4 G

Differentiate lan and wan, Question 1 Differentiate LAN and WAN Questi...

Question 1 Differentiate LAN and WAN Question 2 Explain the TCP/IP Reference Model with diagram Question 3 Describe Circuit switching and message switching Question

Reliable data transfer over a channel bit error rdt : 20, Reliable  data...

Reliable  data  transfer over a channel bit error  rdt : 20 A more realist model  of the underlying  channel  is one  in which  bits in packet may be  computed. Such  bit erro

Difficulties in internetwork communication, Q. Difficulties in Internetwork...

Q. Difficulties in Internetwork Communication? - Data arrive at interface f1 of s1 - How does s1 know that they must be sent out from interface f3? - There is no provisio

Advantages and disadvantage of computer networking , Advantages and Disadva...

Advantages and Disadvantage of Computer Networking Most of the benefits  of networking  can be  divided into  two  generic categories Connectivity and  sharing. Networks

Dns id hacking - domain name server, DNS ID hacking The Dns use ID sys...

DNS ID hacking The Dns use ID system in order to keep track of each every request and replies. In order to spoof the DNS’s response, the hacker needs to do ID Hacking. In orde

Additional bandwidth does each scheme require, Recalling two FEC schemes fo...

Recalling two FEC schemes for internet phone described. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-ra

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