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

Give examples of icmp, Ping and Traceroute are used by ICMP for Testing. ...

Ping and Traceroute are used by ICMP for Testing. Destination Unreachable messages are obtained by a router when it does not have a route to the network.

What are some drawbacks of implementing a ring topology, What are some draw...

What are some drawbacks of implementing a ring topology? In case one workstation on the network varies a malfunction, it can bring down the whole network. Another drawback is t

Example of parallel sections construct, This example demonstrates the use o...

This example demonstrates the use of parallel sections construct. The three functions, fun1, fun2, and fun3, all can be executed concurrently.  Note that all the section directives

Explain the types of security threats, Q. Explain the types of Security Thr...

Q. Explain the types of Security Threats? (a) Normal Flow (b) Interruption: An asset of a system develops into unavailable or unusable. (c) Interception: A few unaut

Telecoms, What is a Multiplexor

What is a Multiplexor

Parallel construct in openmp, Parallel Construct The syntax of the para...

Parallel Construct The syntax of the parallel construct is as follows: #pragma omp parallel [set of clauses]  where clause is one of the following:  structured-block if(sca

Full form of httpd, Full form of HTTPd It stands for HTTP daemon. HT...

Full form of HTTPd It stands for HTTP daemon. HTTPd is the program run on a UNIX platform to establish a Web server. On other platforms, such as Microsoft Windows NT, the We

Explain in brief about the throughput, Explain in brief about the Throughpu...

Explain in brief about the Throughput The medium access control protocol should make as well-organized use as possible of the wireless medium to maximize capacity. Number of

packing -unpacking data with parallel virtual machine , Packing and Unpack...

Packing and Unpacking Data pvm_packs - Pack the active message buffer with arrays of prescribed data type: int info = pvm_packf( const char *fmt, ... ) int info = pv

Round trip time and time out - transport layer, Round Trip Time (RTT) and T...

Round Trip Time (RTT) and Time Out The  size and  the complexity  of computer  networks  have grown  in past years. To achieve  an efficient  and reliable transmission  some

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