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

Recognize the command that shows the sap table, show ipx servers is the co...

show ipx servers is the command that shows the SAP table

Telecommunication switching system, if the signal input to an amplifier is ...

if the signal input to an amplifier is 0 dBm what is the power output in mW if the gain of the amplifier is 20 dB ?

Program to use of lastprivate clause, This example illustrate the use of la...

This example illustrate the use of lastprivate clause void for_loop (int n, float *a, float *b) { int i; #pragma omp parallel { #pragma omp for lastprivate(i) for

What is connection-oriented communication, What is Connection-oriented comm...

What is Connection-oriented communication Connection-oriented communication can be in three phases. In establishment phase a request is made to set up the connection. Only afte

Describe the sequence of events occur in host attempt, The following inform...

The following information was obtained from a host: IP address...............205.133.127.8/24 Default Gateway...... 205.133.127.1 DNS Server.............139.100.110.10

Explain categorization according to pipeline configuration, Categorization ...

Categorization according to pipeline configuration According to the configuration of a pipeline, the below categories are recognized under this classification: Unifunct

When would we use isdn, We use IDSN supports high speed voice, data and vid...

We use IDSN supports high speed voice, data and video and is a good choice for many small businesses.

CLIENT SERVER BLACKJACK, So for this project, we’re going to make a game. ...

So for this project, we’re going to make a game. This game will make use of a server to join two clients together for a modified game of Blackjack.

Tcp-ip routing architecture, Q. Explain TCP-IP Routing Architecture? ...

Q. Explain TCP-IP Routing Architecture? The TCP/IP routing architecture looks extremely much like the OSI routing architecture. Hosts utilize a discovery protocol to o

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