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

Internetworking, In spite of the incompatibilities among networks, research...

In spite of the incompatibilities among networks, researchers have devised a function that gives universal service among heterogeneous networks known 'internetworking'. It uses bot

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

Data alignment in processor arrangements, Data Alignment Arrays are ali...

Data Alignment Arrays are aligned to templates by the ALIGN directive. The ALIGN directive is used to align elements of different arrays with each other, indicating that they s

Discuss network designs, This assignment will assess parts of objectives 2-...

This assignment will assess parts of objectives 2-6 from the subject outline: 1 Explain the principles of logical design 2 Discuss the strengths and weaknesses of various net

Show the parity check - performance, Q. Show the Parity Check - Performance...

Q. Show the Parity Check - Performance? Parity Check - Performance Is able to detect all single-bit errors Can as well detect burst errors if the total number of

Differentiate between adsl and dsl, ENTERPRISE NETWORKING 1. Explain th...

ENTERPRISE NETWORKING 1. Explain that what is a cable? Classify different types of cables. 2. Elaborate switch? Write down the functionalities of switch. 3. Describe rout

Explain about bridges, Bridges The bridge function is to attach separat...

Bridges The bridge function is to attach separate homogeneous networks. Bridges map the Ethernet address of the nodes residing on each network segment and allow only essential

What is forward error correction and data words, What is Forward Error Corr...

What is Forward Error Correction and data words Forward error correction It is the process in which the receiver tries to guess the message by using redundant bits. Da

Find the domain, Find the domain Name of 128.252.160.200

Find the domain Name of 128.252.160.200

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