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

Objectives of operating system for parallel computer, Objective : After...

Objective : After going through this part you will be sure to explain the features of software and operating systems for parallel computers. In particular you should be able

Physical configurations sonet sdh , Physical Configurations Transport ...

Physical Configurations Transport signal multiplexer de multiplexer. It either  signal from multiple   sources into a STS singles  or de multiplexes and STS signal  into diffe

Explain ethernet addressing, Ethernet Addressing Every station on t...

Ethernet Addressing Every station on the network must have a unique physical address Offered by a six-byte physical address encoded on the network interface card (NIC)

Describe the steps involved in network simplex method, QUESTION 1: (a) ...

QUESTION 1: (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of the abov

State the nonselective fading and selective fading, Nonselective fading and...

Nonselective fading and Selective fading Nonselective fading, is a fading in which all frequency methods of the received signal fluctuate in the similar proportions simultaneo

What is logical link control, What is logical link control? One of two ...

What is logical link control? One of two sublayers of the data link layer of OSI reference model, as explained by the IEEE 802 standard. This sublayer is responsible for mainta

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

Describe about radio waves, Radio Waves - Frequency ranges: 3 KHz to 1...

Radio Waves - Frequency ranges: 3 KHz to 1 GHz - Omni directional - Susceptible to interference by other antennas utilizing same frequency or band - Ideal for long-di

What is the administrative distance for igrp, IGRP is a distance vector rou...

IGRP is a distance vector routing protocol designed by Cisco. The maximum hop count is 255, and it uses a combination of variables to verify a composite metric. IGRP has an adminis

Error correcting code - hamming code, Error Correcting Code - Hamming Code:...

Error Correcting Code - Hamming Code: Hamming code is the one of the error-correcting code named after its inventor. Because of the simplicity of the hamming code, it can dete

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