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 are major types of networks and explain, What are major types of netwo...

What are major types of networks and explain? Server-based network: Give centralized control of network resources and depend on server computers to give security and network

Use of two-layer switch, Q. Use of Two-Layer Switch? - Performs at the ...

Q. Use of Two-Layer Switch? - Performs at the physical as well as data link layer - A bridge with many ports designed for faster performance - Allocates unique port to ea

Network performance measured by delay and throughput, Q. Network performanc...

Q. Network performance measured by delay and throughput ? delay versus load Delay is composed of? Throughput v/s network load

Access-list range for an extended ip access-list, Recognize the access-list...

Recognize the access-list range for an extended IP access-list? Ans) IP extended access-lists use the number range of 100-199.

Go back-n ( gbn) - transport layer, Go Back ( GBN) Go back  N ARQ is s...

Go Back ( GBN) Go back  N ARQ is specific  instance of the  automatic  repeat request protocols  in which  the sending  process continues to send  a number of frames specific

Framing, different framing methods

different framing methods

Wait protocol in parallel programming , Wait protocol The wait protoco...

Wait protocol The wait protocol is used for resolving the conflicts, which arise due to number of multiprocessors demanding the same resource. There are two types of wait prot

Recognize the definition of demarcation, Demarcation is the point in which ...

Demarcation is the point in which responsibility changes hands.

advance routing, i need help with this assigmnet reply asap pleas

i need help with this assigmnet reply asap please

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