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 is a database server, With a database server, the client gives SQL req...

With a database server, the client gives SQL requests as messages to the database server. The results of every SQL command are returned over the network. The server uses its own pr

Define transport layer of osi model, Q. Define transport layer of osi model...

Q. Define transport layer of osi model? - The transport layer regulates information flow to makes sure end-to-end connectivity between host applications reliably and accurately

Show scalability and reliability of computer network, How do you account fo...

How do you account for higher scalability and reliability of computer network? Ans: Computer network will have a large number of computers, which can share database, software

Infant mortality period, INFANT MORTALITY PERIOD Initially there are a ...

INFANT MORTALITY PERIOD Initially there are a large number of failures, called initial failures or infant mortality. These failures are primarily due to manufacturing defects,

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

What are the functions of the typical server program, What are the function...

What are the functions of the typical server program? It waits for client-initiated requests. Executes many requests at the same time. Takes care of VIP clients first. Initiate

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

Framing techniques of datalink layer, java program to implement framing tec...

java program to implement framing techniques of datalink layer

Ftp and ftp application layer protocols, What is the difference between TFT...

What is the difference between TFTP and FTP application layer protocols? Ans) TFTP - Trivial File Transfer Protocol A stripped down version of FTP, easy to use and fast. TFTP

frames along with the rtp, For VOIP, first you need to consider the codec ...

For VOIP, first you need to consider the codec to use. Although there are many voice codecs, MyCo wants the safest bet and suggests that you design with the most known and oldest c

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