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 infrastructure design for a banking corporation, this is Our final ...

this is Our final year project where we have to create a network infrastructure design for a banking corporation for their new setup in Australia.for this we have to create network

What is d-amps, What is D-AMPS D-AMPS uses 832 channels (in every dire...

What is D-AMPS D-AMPS uses 832 channels (in every direction) with three users sharing a sole channel. This allows D-AMPS to support up to the 2496 users simultaneously per cel

LAN, categories of LAN

categories of LAN

Cable modem, Currently One more way of accessing the Internet being develop...

Currently One more way of accessing the Internet being developed is the use of cable modems. These need that you subscribe to a cable service & let you two-way communication with t

Use of a distance vector routing algorithm, Question: (a) The diagram ...

Question: (a) The diagram below shows a configuration of Internet routers (A-F) which achieve dynamic routing through the use of a Distance Vector routing algorithm. The metr

What is point to point link, What is point to point link? It refers to ...

What is point to point link? It refers to a direct connection among two computers on a network. A point to point connection does not require any other network devices other tha

Html, write a html program segment that contains hypertext links from one d...

write a html program segment that contains hypertext links from one document to anothersk question #Minimum 100 words accepted#

Compute the number of lost packets of the down-stream, A mobile host (MH) i...

A mobile host (MH) is connected to a WLAN access network that uses MIP for mobility support. Consider that the RTTs between MH and HA are 0.3s while RTTs within a L2 subnet are 80

Illustrate stop-and-wait automatic repeat request, Q. Illustrate Stop-and-W...

Q. Illustrate Stop-and-Wait Automatic Repeat request? - Simplest flow as well as error control mechanism - The sending device keeps a duplicate copy of the last frame transm

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