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

Identify three udp characteristics, UPD is a layer 4 Transport protocol. It...

UPD is a layer 4 Transport protocol. It is connection-less due to it does establish a connection thus the 3 step handshake is not needed, it does NOT execute any flow control or ac

Explain in detail about wireless network, Explain in detail about wireless ...

Explain in detail about wireless network Think about unseen terminal problem. Imagine a wireless network consist of five stations, A through E, such that each one them is in r

Networking security, difference between spambox and inbox in gmail

difference between spambox and inbox in gmail

Explain the transport layer in detail, Explain the transport layer in detai...

Explain the transport layer in detail Transport Layer: Transport layer ensures and controls the end-to-end integrity of data message propagated via the network  amid two devic

How is computer networks used in financial services, Q. How is computer net...

Q. How is computer networks used in Financial services? Financial services:   Today's financial services are totally depended on networks. Application includes credit history

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

What is data traffic, Q. What is Data traffic? Data traffic ...

Q. What is Data traffic? Data traffic Peak data rate : max data rate of the traffic Average data rate = (amount of data)/time Maximum Burst size: max. l

#incident response scenario, assignment is for incident response In this ...

assignment is for incident response In this final week, you will provide a short procedures document (2–3 pages) concerning the steps by which to prepare for and execute expert te

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