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

Define topologies other than basic topologies, What are the popular topolog...

What are the popular topologies other than basic Topologies? Apart from basic topologies some other topologies worth considering are: mesh topology (each device linked to all o

Modify the tcp server and udp server in client server, Let's imagine that w...

Let's imagine that we have 2 TCP clients. A simple one (modTCPClient.c) like the one you wrote in the first part of project 2 and another one (modTCPClient1.c) that after it connec

What is silly window syndrome, What is silly window syndrome? It is a d...

What is silly window syndrome? It is a difficulty that can ruin TCP performance. This problem happens when data are passed to the sending TCP entity in large blocks, but an int

Client-server , We need to design and implement a secure conference system....

We need to design and implement a secure conference system. The system will allow users to connect to a conference server and to participate in a shared conversation. The conversat

Bootrom and memory layout, Memory Memory Layout   BOOT...

Memory Memory Layout   BOOTROM This device stores the information of  the startup diagnostic  code in permanently. It performs diagnostics of  hardware  wh

Objective of parallel algorithms, After studying this part the students wil...

After studying this part the students will be able to understand about the following: Analysis of Parallel Algorithms; Different Models of Computation; o   Interco

What is clipper, Clipper is a compiler that was well recognized at the time...

Clipper is a compiler that was well recognized at the time of80's and early times of 90's. We can build DOS based applications (even large applications too) using clipper. There is

On which languages intranet works, On which languages Intranet works ...

On which languages Intranet works Language Support The Intranet works on the basis of scripts written in any of the following languages, viz., SGML, HTML, DHTML, XML, AS

Tree interconnection network, Tree interconnection network Tree inter...

Tree interconnection network Tree interconnection network(TIN)), processors are organized in a whole binary tree pattern.

Conversion binary to hexadecimal, Qustion: Convert the binary number 10...

Qustion: Convert the binary number 10111100 to hexadecimal.

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