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 uniform resource locator, What is Uniform Resource Locator A...

What is Uniform Resource Locator Address of location for accessing Web pages. Clicking on an icon or "hot text" is the most common means of accessing and using a URL. Typing

How can data to be exchanged between networks, Q. How can data to be exchan...

Q. How can data to be exchanged between Networks? Internetwork Links in an internetwork

Write your own http client to test your server, - The project should includ...

- The project should include a web server, and an example webpage - Webserver should continue to accept multiple requests from client browser - Webserver should print out logs: how

What is a web server in client server environment, This new model of Client...

This new model of Client/Server having of thin, portable, "universal" clients that talks to superfast servers. In the simple form, a web server returns documents when clients ask f

Explain about the switches, Explain about the Switches LAN switches are...

Explain about the Switches LAN switches are an expansion of the method in LAN bridging, which controls data flow, handles transmission errors, gives physical addressing, and ma

#tit, objective practical questios answers

objective practical questios answers

Barters, What is a OSI layer 2 device called a "barter"?

What is a OSI layer 2 device called a "barter"?

What are the security models by giving striking analogies, Security models ...

Security models by giving striking analogies to the real world A classical case study: (With due acknowledgements to the security exponent who proposed this theory.) He has c

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