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

Explain dynamic key management mechanism, Question: a) Consider the f...

Question: a) Consider the following MIP scenario. Quite a few enterprise networks use private addresses and NAPT for the communication to the Internet. i. Discu

What is network virtual terminal, What is NVT (Network Virtual Terminal) ...

What is NVT (Network Virtual Terminal) It is a set of rules explaining a very simple virtual terminal interaction. The NVT is used in the begin of a Telnet session.

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

Error correction in burst error correction, Q. Error Correction in Burst Er...

Q. Error Correction in Burst Error Correction? Error Correction-Burst Error Correction In its place of sending all the bits in a data unit together we can organize "N

Explain about star backbone network, Q. Explain about Star Backbone network...

Q. Explain about Star Backbone network? - Collapsed or switched backbone - Backbone is just one switch that connects LANs - Utilized as distribution backbone inside a bui

Explain the technique- backpressure, Explain the technique- Backpressure ...

Explain the technique- Backpressure This technique produces an effect same to backpressure in fluids flowing down a pipe. It includes link-by-link use of flow control in a dire

Compare delays in packet switching and circuit switching, In this question,...

In this question, you will compare delays in packet switching (i.e. in IP networks), in circuit switching (i.e. in PSTN telephony) and in virtual circuit packet switching (i.e. in

Describe in detail how rsvp actually works, Normal 0 false fa...

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

Show the error correction by hamming code, Q. Show the Error Correction by ...

Q. Show the Error Correction by Hamming Code? Hamming Code is able to be applied to data units of any length and uses the relationship between data and redundancy bits For i

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