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

State the latest technology in the line of intranet, State the latest techn...

State the latest technology in the line of Intranet The latest technology in the line of Intranet tools has been the Web-based Distributed Authoring and Versioning (WebDAV), w

How does a firewall protect, How Does a Firewall Protect Firewalls work...

How Does a Firewall Protect Firewalls work by controlling the information that comes in and out of the network. By using the Application Proxy service, the flow of information

Describe geostationary geo satellites, Geo stationary satellite The sat...

Geo stationary satellite The satellite which is known as earth-orbiting satellite is called geo stationary satellite. The geo stationary satellite is placed directly over the e

Subscriber database - computer network, Subscriber Database Core ne...

Subscriber Database Core network  also hosts  the subscribers  database ( for e, g HLR in GSM systems). Subscriber  database  is accessed by core  network  nodes fro  funct

Analysis of sort_bitonic, The bitonic sorting network needed log n number o...

The bitonic sorting network needed log n number of stages for performing the task of sorting the list. The first n-1 stages of the circuit are able to sort two n/2 numbers and the

How network gateway is different from routers, Gateway A device linked...

Gateway A device linked to multiple physical TCP/IP networks capable of routing or delivering IP packets among them. Router It's a layer 3 device that connects 2 diss

Checksum - transport layer, Checksum This 16 bits field contain  th...

Checksum This 16 bits field contain  the checksum. The  calculation of the   checksum for TCP follows  the same  procedure as the  described for  UDP. However the inclusion

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