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 multi-mode fiber, What is Multi-mode fiber Multi-mode fiber use...

What is Multi-mode fiber Multi-mode fiber uses LEDs like the light-generating devices while single-mode fiber generally uses lasers. FDDI specifies the utilization of dual r

Flow control in TCP, Q. Flow control in TCP? The amount of data a s...

Q. Flow control in TCP? The amount of data a source is able to send before receiving an ACK from the destination Whether to send 1 byte of data as well as wait for ACK

Undesirable sharing - fundamentals of networks, Undesirable Sharing ...

Undesirable Sharing With  the good  comes  the bad  while  networking  allow  the easy  sharing  of useful  information it also  the sharing  of undesirable  data. One sign

Tcp segment structure - transport layer, TCP Segment Structure Figure ...

TCP Segment Structure Figure shows the format of the TCP segment. The  header consists  of a 20 bytes  fixed  part  plus a variable size  options fields. The description  o

Http is stateless - discuss this statement, Question : (a) Describe, w...

Question : (a) Describe, with the aid of a diagram, a hybrid topology of a network of your choice. (b) Briefly explain the similarity and differences between a switch and

How does it optimise handovers in cellular networks, Question: (a) In r...

Question: (a) In relation with a cellular network architecture, describe the following terms: (i) Clusters (ii) Pico cells (iii) Nano cells (iii) Cell breathing (b)

Bit stuffing, bit stuffing program in python

bit stuffing program in python

What is meant by middleware, Middleware is distributed software required to...

Middleware is distributed software required to support interaction among clients and servers. In short, it is the software that is in the middle of the Client/Server systems and it

Parallel balance point, Parallel Balance Point In order to implement a ...

Parallel Balance Point In order to implement a parallel algorithm on a parallel computer, K number of processors is needed. It may be noted that the given input is assigned to

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