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 traffic shaping, Normal 0 false false false EN-...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Describe a typical dns system, Question: (a) With the help of a diagra...

Question: (a) With the help of a diagram, describe a typical DNS system. (b) Using signal sequence or state transition diagrams, illustrate the following scenarios: i.

Determine the value of slow start threshold, Assuming that TCP Reno is used...

Assuming that TCP Reno is used, consider the following diagram illustrating the behaviour of congestion window, and answer the questions below. a)  What was the value of sl

Unused reserved - trannsport layer, Unused Reserved This  is a 6 bi...

Unused Reserved This  is a 6 bite field  reserved for future use.

Bridge - network layer and routing , Bridge A bridge  operation sin bo...

Bridge A bridge  operation sin both  physical  and data link  layer of OSI model. At physical  layer  it works  like  repeater as it regenerates the  signal  and performs  int

Example programmes for parallel systems-adding element, Example Programmes ...

Example Programmes for Parallel Systems Now we shall complete this with the examples on shared memory programming. Example 13: Adding elements of an array using two proce

How two adjacent layers communicate in a layered network, How two adjacent ...

How two adjacent layers communicate in a layered network? (or What do you mean by Service Access Point?) In layered network, each layer has lots of entities and entities of lay

Header length - transport layer, Header  length This  field  speci...

Header  length This  field  specifies the  length of the TCP header  in 32 bit  words. This  information  allows  the receiver to know  the beginning of the data area becau

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