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

What is source route and ospf, What is source route and OSPF? Source r...

What is source route and OSPF? Source route It is a series of IP addresses identifying the route a datagram must follow. A source route might optionally be included in an

What is multistation access unit, Multistation Access Unit (MAU) C...

Multistation Access Unit (MAU) Combines individual automatic switches May perhaps daisy chain to support more stations

System - network administrator, The program must be well documented which i...

The program must be well documented which includes meaningful variable and subroutine names ("self documenting code") along with comments in the code. The following block of code w

Reliable data transfer over a perfectly reliable channel r, Reliable  dat...

Reliable  data transfer  over a perfectly reliable channel rdt 1.0 First  all consider  the simplest  care in  which  the underlying  channel  perfectly reliable.  The protoco

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 are the brigdes, Brigdes Introduction - LAN may require to cove...

Brigdes Introduction - LAN may require to cover more distance than the media can handle effectively or - Number of stations may perhaps be too great for efficient frame d

The application layer - fundamentals of networks, The application layer ...

The application layer This  layer enables users  to access the  network  by providing  a few  services to the user some of the protocols and services available to the  user ar

Enumerate the various internetworking facility, Enumerate the various inter...

Enumerate the various internetworking facility 1.) Give a link among networks. At minimum, a physical and link control connection is required.   (2) Provide for the routing

Media, explain history of internet?

explain history of internet?

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