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 a database server, What is a Database Server? With a database s...

What is a Database Server? With a database server, the client passes SQL requests as messages to the database server. The results of every SQL command are returned over the net

Characteristic of store and forward switches, Write the characteristic of S...

Write the characteristic of Store and Forward switches? A)     Store and Forward switch will not forward fragments. B)      The longer the frame, the longer the delay (latenc

What are the key design issues of a computer network, What are the key desi...

What are the key design issues of a computer Network? a. Connectivity b. Cost-effective Resource Sharing c. Support for common Services d. Performance

Process switching and fast switching, Process Switching It applies the...

Process Switching It applies the brute force method to switch packets wih consumption of large amount of CPU time List of items are needed when switching packets Routing

Internet service provider (isp), Internet  Service Provider (ISP) Thi...

Internet  Service Provider (ISP) This  supper fast  network  spanning  the world  from  one major  metropolitan area to another  is provided  by a handful of national internet

#incident response scenario, assignment is for incident response In this ...

assignment is for incident response In this final week, you will provide a short procedures document (2–3 pages) concerning the steps by which to prepare for and execute expert te

Explain about multiplicative decrease, Q. Explain about Multiplicative Decr...

Q. Explain about Multiplicative Decrease ? Multiplicative Decrease (MD) if a time-out take places the threshold is set to one maximum segment size (TCP Tahoe, TCP Reno).

Redhat, short note on redhat updation details? why redhat is popular?

short note on redhat updation details? why redhat is popular?

Why it is essential to have layering in a network, Q. Why it is essential t...

Q. Why it is essential to have layering in a network? Ans: A computer network is a very complicated system. It becomes very hard to implement as a single entity. The layered ap

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