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

Determine the level of fibre channel standard, Determine the level of Fibre...

Determine the level of Fibre Channel standard The Fibre Channel standard is organized into five levels: FC-0: The Physical Interface and Media Level handles a variety of phy

Program to reload the router -ccna, Cable, Erase, and Reload the Router ...

Cable, Erase, and Reload the Router Step 1: Cable the network. Cable a network that is same to the one in the topology diagram. Step 2: Clear the configuration on the rou

What is tcp/ip, TCP/IP is a name provided to the collection (or suite) of n...

TCP/IP is a name provided to the collection (or suite) of networking protocols that have been used to construct the global Internet. The protocols are also referred to as the DoD (

Characteristics of the user private group scheme, Question: a) The cpi...

Question: a) The cpio utility has three operating modes. What are they? b) The characters of the permission string are broken up into three groups of three characters. Ex

List some most useful advantages of token ring, List some most useful advan...

List some most useful advantages of Token Ring. Here are Token ring's most useful advantages: a. It depends excellent throughput under high-load conditions. b. Token Ring

Shared memory programming, We know that all processors share a common memor...

We know that all processors share a common memory in shared memory model. Every processor, however, can be assigned a different part of the program stored in the memory to implemen

What are different ways of securing a computer network, What are different ...

What are different ways of securing a computer network? There are lots of ways to do this. Install reliable and updated anti-virus program on all computers. Make sure firewalls

Matrix computation and multiplication, In the following section, we shall d...

In the following section, we shall discuss the algorithms for solving the matrix multiplication difficulty using the parallel models. Matrix Multiplication Problem Let ther

Analyze snort or pcap data from a public wifi hotspot, The project idea is ...

The project idea is : Analyze Snort or PCAP data from a public WIFI hotspot (describe traffice seen and what it is, protocols, ports, etc). This is what is expected. Initially r

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