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

Illustrate 802.11b HR DSSS, 802.11b HR DSSS a) High-rate DSSS using a ...

802.11b HR DSSS a) High-rate DSSS using a 2.4 GHz band b) Similar to DSSS excluding for encoding method c) Uses complementary code keying (CCK), encoding 4 or 8 bits to

Illustrate about sliding window protocols, Q. Illustrate about Sliding Wind...

Q. Illustrate about Sliding Window Protocols? - Sliding window - Keeps the unacknowledged outstanding frames in sender - Keeps the expected frames in receiver - Sequen

Determine the definition of hdlc, Determine the definition of HDLC HDLC...

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in

Building routing tables, There are basically two functions for creating rou...

There are basically two functions for creating routing tables, which are as given: Manual entry Software Further there are two types for computing routing table inf

What are the five major network services, What are the five major network s...

What are the five major network services? Major Network Services are: a. File Services b. Message Services c.  Print Services  d.  Application Services e.  Datab

What is the terminal emulation, What is the Terminal Emulation, in which la...

What is the Terminal Emulation, in which layer it comes? Ans) The use of software, installed on PC or LAN server, that permits the PC to function as if it were dumb terminal dir

Explain design issues of interconnection network, Design Issues Of Intercon...

Design Issues Of Interconnection Network Below are the issues, which must be considered when designing an interconnection network. 1)  Size and Dimension of network:  It m

Arrays pointers for parallel algorithms, Arrays Pointers An array is a ...

Arrays Pointers An array is a set of the same type of data. Arrays are very well-liked data structures in parallel programming due to their easiness of use and declaration. At

Udp connection establishment & termination, simple introduction,defination ...

simple introduction,defination and with example & digram

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