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

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

Determine in detail about the world wide web, Determine in detail about the...

Determine in detail about the world wide web The latest has been Web commerce that is currently making big news, and many businesses are setting up electronic shops on the Inte

What is meant by transparency, Transparency really means adumbrating the ne...

Transparency really means adumbrating the network and its servers from the users and even the application programmers.

Discuss about the jpeg and ldap, Discuss  about the JPEG and LDAP J...

Discuss  about the JPEG and LDAP JPEG: Stands for Joint Photographic Experts Group.  A standard format of storing digitized, colour, or black-and-white photographs. JPEG fi

What is manchester, Q. What is Manchester? - Utilizes an inversion at t...

Q. What is Manchester? - Utilizes an inversion at the middle of each bit interval for both synchronization and bit representation - Negative-to-positive represents binary 1

Compare error detection and error correction, Compare Error Detection and E...

Compare Error Detection and Error Correction: The correction of errors is more difficult than the detection. In error detection, checks only any error has happened. In error co

Find the domain, Find the domain Name of 128.252.160.200

Find the domain Name of 128.252.160.200

Antenna Network of 16.4m Earth Station , (a ) Std "A" 16.4 m C-BAND EARTH ...

(a ) Std "A" 16.4 m C-BAND EARTH STATION (1996) This is the main system of this station and provides connectivity to most of the countries through dedicated transponder channe

Concept of connection between the pc and the cable modem, Concept of connec...

Concept of connection between the PC and the cable modem Even if downstream channel works at 27 Mbps, user interface is nearly always 10-Mbps Ethernet. There is no way to get b

Describe techniques used in location based services, Question: a) Comp...

Question: a) Compare Bluetooth and WIFI based networks over the following factors: Data rate, Range, Application Focus, Battery Power, Frequency Band, Security. b) Differe

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