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 definition of demarcation, Demarcation is the point in which ...

Demarcation is the point in which responsibility changes hands.

What is sap, What is SAP? Series of interface points that permit other ...

What is SAP? Series of interface points that permit other computers to interact with the other layers of network protocol stack is known as SAP.

Electrical characteristics of 9-pin RS232 connector, Q. Electrical Characte...

Q. Electrical Characteristics of 9-Pin RS232 Connector? Electrical Characteristics - Single-ended One wire per signal and voltage levels are with respect to s

Illustrate network layer in osi layers model, Q. Illustrate Network Layer i...

Q. Illustrate Network Layer in osi layers model? Network Layer :  This is responsible for addressing messages and data so they are sent to the required destination, and for tr

Difference between latches and flip flops, What is the basic difference bet...

What is the basic difference between latches and flip flops? Ans) flip flops have clock signal whereas latches dont require anyclock pulse..

Throughput, Throughput is a calculate of the rate at which data can be tran...

Throughput is a calculate of the rate at which data can be transmit through the network. The throughput capability of the underlying hardware is known bandwidth. Because every fram

Internet architecture, Company seldom uses a single router to connect its e...

Company seldom uses a single router to connect its entire network for two purpose. Because the router must transmit every packet, the processor in a provided router is insuff

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