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

Define client and server, Question 1 Define client and server. Explain the...

Question 1 Define client and server. Explain the Client server model Question 2 What is a Mainframe System? Write down the features of Mainframe System Question 3

Advantages of mobile wireless network, Advantages of mobile wireless networ...

Advantages of mobile wireless network over a wired network is it is very much popular, it is very easy to set up, it requires a simple plug and the speed and reliability is very

Define the terms unicasting and multiccasting, Define the terms Unicasting,...

Define the terms Unicasting, Multiccasting and Broadcasting? If the message is sent from a source to a one destination node, it is called Unicasting. If the message is sent

Off the shelf company, Draw a work breakdown structure (WBS) diagram for th...

Draw a work breakdown structure (WBS) diagram for the project, to show all the planned tasks. This WBS should contain at least two levels. b) Explain the main differences between

Typical functional units of the client/server applications, What are the mo...

What are the most typical functional units of the Client/Server applications? Ans) typical functional units of the Client/Server applications User interface Business Logic

Write examples of the transport layer, Example of transport layer are:- ...

Example of transport layer are:- a) TCP is connection oriented. b) UDP is connectionless

Transport layer protocols , TCP (Transmission Control Protocol) and UDP are...

TCP (Transmission Control Protocol) and UDP are used by TCP/IP. SPX (Sequenced Packet Exchange) is used with IPX. NBP (Name Binding Protocol) is used with Appletalk.

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