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 clipper, Clipper is a compiler that was well recognized at the time...

Clipper is a compiler that was well recognized at the time of80's and early times of 90's. We can build DOS based applications (even large applications too) using clipper. There is

Working of TCP - buffers, Q. Working of  TCP - buffers? TCP - buffers ...

Q. Working of  TCP - buffers? TCP - buffers Sending & receiving buffers - Processes don't consume data at the same speed Sending site: - White section: unfilled

Explain the term- bits and bitmap, Explain teh term- Bits and Bitmap ...

Explain teh term- Bits and Bitmap Many tiny dots, which are put together to make a picture. Bits are combined to make a graphic image called a bitmap. GIF and JPEG files are

Options negotiation - transport layer, Options Negotiation To use any ...

Options Negotiation To use any of the options first  requires option  negotiation between the client  and server. Four  control  characters are used for  this purpose.

Define about the term - hackers, Define about the term - hackers Every ...

Define about the term - hackers Every time technology updates itself, new techniques evolve. At the same time thieves or intruders (in the information technology line, they are

What does a metric of 16 hops showwhen using RIP , Destination unreachable ...

Destination unreachable Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Illustrate the drawbacks of stop and wait, Q. Illustrate the Drawbacks of s...

Q. Illustrate the Drawbacks of stop and wait? Drawbacks of stop and wait - Only one frame is able to be in transit at a time - After every frame sent the host must wai

Sate 802.11 architecture, 802.11 Architecture ESS (Extended service set...

802.11 Architecture ESS (Extended service set) two or more BSSs with APs connected through a distribution system (wired LAN) in an infrastructure network

Process of skype is a web-based service, Skype is a web-based service which...

Skype is a web-based service which offers cheap and free phone calls. Explain step by step (in terms of networking technology) what really happens from the point when you initiate

Metropolitan area network ( man)- fundamentals of networks , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE Metropolitan area Network ( MAN) Metropoli

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