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

Networking & computer architecture long question, Write discussion on Assoc...

Write discussion on Associative mapping - computer architecture.

Explain the terms - lan extension and ad hoc network, Explain the terms - L...

Explain the terms - LAN extension and Ad hoc network LAN extension: a wireless LAN integrated with a wired LAN to extend the coverage area of the LAN complex; Cross-building

Switching creates variable latency through the switch, DEFINITION: Latency ...

DEFINITION: Latency = Delay. Because a store and forward switch reads the entire frame before forwarding, a larger frame takes longer than a shorter frame.

Des key, Assume the following 64-bit DES key (expressed in hexadecimal): FE...

Assume the following 64-bit DES key (expressed in hexadecimal): FEFE FEFE FEFE FEFE (a) What is the term for such a key? (b) State the value of each of the 48-bit round keys

Mesh, Mesh It is of two dimensional network.  In this every processi...

Mesh It is of two dimensional network.  In this every processing elements are arranged in a two dimensional grid. The processor are in rows i and column j are denoted by PEi

What is bia, Burn in Address other name is MAC address

Burn in Address other name is MAC address

sorting circuit along with odd-even merging circuit, As we previously know...

As we previously know, the merge sort algorithm needs two circuits, i.e. one for merging and second for sorting the sequences. Thus, the sorting circuit has been derived from the a

Wireless Networks, Is a complete OSI/TCPIP network architecture available i...

Is a complete OSI/TCPIP network architecture available in MATLAB?

Security mechanism, How can the use of NAT and PAT, be considered a securit...

How can the use of NAT and PAT, be considered a security mechanism? Research the acronym(s) if it is not a part of your collection.

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