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

Determine the 802.11g ofdm, 802.11g OFDM a) Uses OFDM with same 2.4 GH...

802.11g OFDM a) Uses OFDM with same 2.4 GHz band b) Achieves a 54-Mbps data rate c) Works with same 802.11b equipment

What is groupware server, What is Groupware server? Groupware addresses...

What is Groupware server? Groupware addresses the management of semi-structured information like text, image, mail, bulletin boards and the flow of work. These Client/Server sy

Public key cryptography and private key cryptography, Question: a) Di...

Question: a) Differentiate between the following key terms used in any e-banking security system: (i) Authorisation v/s Authentication. (ii) Data Integrity v/s Data Conf

What is traffic shaping, Normal 0 false false false EN-...

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

What do you understand by protocol, Q. What do you understand by Protocol? ...

Q. What do you understand by Protocol? Ans:  In the context of data networking, a protocol is a formal set of rules and conventions that governs how computers interchange infor

Discuss user datagram protocol, Problem 1 Bring out the differences bet...

Problem 1 Bring out the differences between POP and IMAP4 Problem 2 Discuss User Datagram protocol Problem 3 Explain the various steps in TCP congestion control

Explain the forward congestion avoidance process, Explain the Forward conge...

Explain the Forward congestion avoidance process Notifies the user that congestion avoidance process should be initiated where applicable for traffic in the similar direction a

Explain silly window syndrome, Q. Explain Silly window syndrome? When e...

Q. Explain Silly window syndrome? When either sending application sends data gradually or receiving application consumes data slowly - Illustration when 1 byte sent 40 bytes

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