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

Network topology, identify different network topologies.

identify different network topologies.

Define the term network throughput, Network throughput It is a symptoma...

Network throughput It is a symptomatic measure of the message carrying capability of a network. It is termed as the total number of messages network can send in per unit time.

Bit stuffing, bit stuffing program in python

bit stuffing program in python

What is the last step in data encapsulation, The Five steps to data encapsu...

The Five steps to data encapsulation (IN ORDER): 1) User information is changed into data. 2) Data is changed into segments. 3) Segments are changed into datagram and pack

Describe some common threats to the hardware, Describe some common threats ...

Describe some common threats to the hardware Theft of a computer, printer, or other resources. Tampering by a disinterested or frustrated employee who takes every chan

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

., Given a five station token bus LAN with station addresses of 3000, 500, ...

Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assum

What are the protocol support tools, What are the Protocol Support Tools ...

What are the Protocol Support Tools The Intranet should support the tools meant for providing various services on the Internet through the protocols. In addition to the convent

Uneven load distribution, Uneven Load Distribution In the parallel com...

Uneven Load Distribution In the parallel computer, the problem is dividing into sub-problems and is assigned for computation to various processors. But sometimes the sub-probl

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