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

What advantages does fiber optics have over other media, What advantages do...

What advantages does fiber optics have over other media? One main advantage of fiber optics is that is it less susceptible to electrical interference. It also supports higher ba

Calculate bandwidth needed for voice traffic, The second point to consider ...

The second point to consider is that from each location, some calls are internal to that site and some are going to outside locations. Again, as an approximation, MyCo telecom peop

Show the character-level encryption, Q. Show the Character-level Encryption...

Q. Show the Character-level Encryption? - Substitutional - Monoalphabetic - simplest form; also called Caesar cipher - Every character is replaced with another character

What is tracert, What is tracert? Tracert is a Windows utility program ...

What is tracert? Tracert is a Windows utility program that can used to trace the route taken by data from the router to the destination network. It also represents the number o

Define what is a software agent, QUESTION (a) Define what is a software...

QUESTION (a) Define what is a software agent? (b) An intelligent agent is known to exhibit several characteristics or properties that distinguish it from another piece of so

url connection instance, What is the difference among URL instance and URL...

What is the difference among URL instance and URL Connection instance? Ans) A URL instance represents the location of a resource, and a URL Connection instance shows a link for

Describe the hardware complexity of benz network, Q. Describe the Hardware ...

Q. Describe the Hardware complexity of Benz Network? Hardware complexity of Benz Network:  Benz network employs lesser switches and it gives good connectivity. To come across h

Describe networking, Describe networking. Networking refers to the inte...

Describe networking. Networking refers to the inter connection among computers and peripherals for data communication. Networking can be done using wired cabling or by wireless

E-NRZ, A modified NRZ code known as enhanced-NRZ (E-NRZ) operates on 7-bit ...

A modified NRZ code known as enhanced-NRZ (E-NRZ) operates on 7-bit words; inverting bits 2,3,6 and 7; and adding one parity bit to each word. The parity bit is chosen to make the

Parallel random access machines, PRAM is one of the models used for designi...

PRAM is one of the models used for designing the parallel algorithm as given in Figure. The PRAM models have the following components: A set of identical type of processors

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