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

Encoding the data type, ENCODING THE DATA TYPE: The figure explain a f...

ENCODING THE DATA TYPE: The figure explain a frame in which the data kind is specified by using the data area. To ensure interoperability format of encoding location m

Distinguish between flow control and congestion control, Question: (a) ...

Question: (a) Distinguish between Flow Control and Congestion Control. (b) Explain clearly how a URL is resolved by a computer. (c) List one application that uses TCP

describe the mips instructions - computer architecture, 1.  Detail for eac...

1.  Detail for each of the four following MIPS instructions, which actions are being taken at each of their five steps.  Do not forget to mention how and during which steps each in

Network topology and design, Question 1: The following is a dump of a T...

Question 1: The following is a dump of a TCP header in hexadecimal format: 00CD0018 00000EF1 00000D5D 502200D1 01BF0010 Please answer the following two parts of questions

What is structured query langauge (sql), SQL is a powerful set-oriented lan...

SQL is a powerful set-oriented language which was developed by IBM research for the databases that adhere to the relational model. It having of a short list of powerful, yet highly

Explain session layer in osi model, Q. Explain Session Layer in osi model? ...

Q. Explain Session Layer in osi model? - The session layer defines how to control, start and end conversations (called sessions) between applications. - This includes the c

Password authentication protocols (pap), Password Authentication Protocols ...

Password Authentication Protocols (PAP) PAP  implements the  traditional username and password  authentication methods. At the  request from  an authenticator the client respon

Describe at one disadvantage of a peer to peer network, Describe at one dis...

Describe at one disadvantage of a peer to peer network. When you are accessing the resources that are shared by one of the workstations on the network, that workstation takes

Barters, What is a OSI layer 2 device called a "barter"?

What is a OSI layer 2 device called a "barter"?

Explain the layer which is closer to the user, There is only an applicatio...

There is only an application layer which is closer to user and also gives many application which user directly linked.for ex:- web browser

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