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

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

#incident response scenario, assignment is for incident response In this ...

assignment is for incident response In this final week, you will provide a short procedures document (2–3 pages) concerning the steps by which to prepare for and execute expert te

Show the security policy as well integrated security, Q. Show the Security ...

Q. Show the Security Policy as well Integrated Security ? Security policy is on paper statement describing what assets are to be protected and why who is responsible and which

Command structure in distributed enrollment protocol , Command Structure: ...

Command Structure: Commands are all-upper-case strings, either 4 or 6 characters in length. Table 1 shows the commands, and (for method commands) the parameters, return values, ex

Frequency division multiplexing, Frequency Division Multiplexing Frequ...

Frequency Division Multiplexing Frequency  division  multiplexing (FDM) is an analogy technique that can be applied when the bandwidth of a link is greater than the combined b

Describe in brief about tree topology, Tree topology Comments 1 -...

Tree topology Comments 1 - This features star nodes on a bus network 2 - All the disadvantages and advantages of both types of networks described above apply to this s

What are super servers, These are fully-loaded machines which consists of m...

These are fully-loaded machines which consists of multiprocessors, high-speed disk arrays for interview I/O and fault tolerant features.

Disadvantages - point to point , Disadvantages You typically  would  no...

Disadvantages You typically  would  not use a packet filter  as your  only security solution for your network  packets filters have two  major  disadvantages. a. Low securit

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