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

Determine the working of lan within a corporate network, Determine the work...

Determine the working of LAN within a corporate network It should be very clear right from the beginning that a firewall is not simply for protecting a corporate network from u

Managing and securing the web utility of the router, Managing and Securing ...

Managing and Securing the Web Utility of the Router Step 1: Configure web access. Navigate to the Administration section. Change the router password to cisco. For Web Uti

Network access technologies, Question 1 Explain the following with respect...

Question 1 Explain the following with respect to Data Encoding                     Digital Signaling of Digital Data                     Digital Signal Encoding Techniques Questi

One basic component is the network device, QUESTION 1. A system analyst...

QUESTION 1. A system analyst has to install a particular type of topology in a textile industry. (a) Describe using diagrams the three most common topologies in terms of nod

Service paradigm, At the minimum level most networks sends individual packe...

At the minimum level most networks sends individual packets of data and the network needs each packet to follow an exact format dictated by the hardware, which is known service par

What is peripheral connect interface, Q. What is Peripheral Connect Interfa...

Q. What is Peripheral Connect Interface? PCI signify Peripheral Connect Interface. It's the revolutionary high speed expansion bus presented by Intel.  With the growing signifi

What are ip addresses, What are IP addresses? IP address refers to the ...

What are IP addresses? IP address refers to the name of a computer on a network, like the Internet. An Identifier for a computer or device on a TCP/IP network, like the

Explain about virtual circuit switching, Q. Explain about Virtual Circuit S...

Q. Explain about Virtual Circuit Switching? Virtual Circuit Switching - All packets belong to a message (or) session is preserved. - Single route is selected between s

What is segmentation and fragmentation, To split data in pieces is known as...

To split data in pieces is known as segmentation and divide segmentation in pieces called Fragmentation. #question..

Explain about traditional modems, Q. Explain about Traditional Modems? ...

Q. Explain about Traditional Modems? - Subsequent to modulation by the modem an analog signal reaches the telephone company switching station where it sampled and digitized to

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