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

Name the building blocks of client/server?, There are three building blocks...

There are three building blocks of client/server a) The client   b) The server and   c)  Middleware.

Explain the importance of authentication, Explain the importance of authent...

Explain the importance of authentication. Authentication is the method of verifying a user's credentials before he can log into the network. It is normally performed using a us

What does jade stands for, QUESTION (a) Briefly describe the dire...

QUESTION (a) Briefly describe the direct coordination model and the meeting oriented coordination model (b) What does JADE stands for? (c) Name the three spec

Show the basic handover types in umts, Question: (a) Show the main elem...

Question: (a) Show the main elements of the GSM system architecture and describe their functions. (b) Looking at the HLR/VLR database approach used in GSM-how does this arc

What do you mean by flow control, Q. What do you mean by Flow Control? ...

Q. What do you mean by Flow Control? - How much data sender is capable to transmit before receiving the ACK - Why flow control? - Limitation with receiver 1. Processin

Statements about ppp and slip for wan communications, State the statements ...

State the statements about PPP and SLIP for WAN communications?  Ans)    a) PPP uses its Network Control Programs (NCPs) component to encapsulate many protocols.  b) SLIP

Explain about the cell splitting, Cell splitting  In practice, the dist...

Cell splitting  In practice, the distribution of traffic and topographic features is not uniform, and this shows opportunities of capacity enhance. Cells in areas of high usage

What is meant by symmentric multiprocessing, What is meant by Symmentric Mu...

What is meant by Symmentric Multiprocessing (SMP)? It treats all processors as equal. Any processor can do the work of any other processor. Applications are divided into thread

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