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

Define carrier sense multiple access collision avoidance, Carrier Sense Mul...

Carrier Sense Multiple Access/Collision Avoidance a) Necessary since wireless LANs cannot implement CSMA/CD b) Collision detection requires increased bandwidth requirements

Describe about the network equipment and connectivity, Describe about the N...

Describe about the Network equipment and connectivity Network equipment and connectivity should address various networking equipments such as routers, types of cables, as well

Explain about virtual circuit switching, Q. Explain about Virtual Circuit S...

Q. Explain about Virtual Circuit Switching? Virtual Circuit Switching - All packets belong to a message (or) session is preserved. - Single route is selected between s

What is crc and checksum, What is CRC and Checksum CRC (Cyclic redudan...

What is CRC and Checksum CRC (Cyclic redudancy check) CRC, is the most powerful of the redundancy checking methods, is based on binary division. Checksum Checksum

Thread libraries, The most difficult representatives of shared memory progr...

The most difficult representatives of shared memory programming models are thread libraries present in mainly of the modern operating systems. Some examples for thread libraries ar

Routing through an internetwork, Which layer is responsible for routing by ...

Which layer is responsible for routing by an internetwork Ans) The Network layer is responsible for routing. This is the primary job of routers, which handle at the Network laye

Describe briefly how the news filtering agent works, QUESTION (a) Conce...

QUESTION (a) Concerning agents that reduce workload, there are four agents developed using a learning approach among which is the News Filtering Agent. Name the other three age

Local and wide area networking, A. Current setting A new bank has its he...

A. Current setting A new bank has its headquarters located in City A. Recently, the bank has opened its first branch in City B, and its data centre in City C. The three cities a

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