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 sliding window protocols, Q. What is Sliding Window protocols? ...

Q. What is Sliding Window protocols? Alternatives: Sliding Window protocols - One task begins prior to the other one ends                                     (concept of

How is computer networks used in teleconferencing, Q. How is computer netwo...

Q. How is computer networks used in teleconferencing? Teleconferencing: Teleconferencing allows conference to happen without the participants being in the same place. Applica

Signal to noise ratio, Problem 1. Explain the TCP/IP Reference Model wi...

Problem 1. Explain the TCP/IP Reference Model with diagram 2. Describe the following Maximum Data Rate of a Channel Signal to Noise Ratio   3. Describe the

Determine the advantages of fast ethernet, Fast Ethernet Operates a...

Fast Ethernet Operates at 100 Mbps faster speeds required for image processing, CAD, real-time audio and video No change in frame addressing, format or access method

How lans connected to internet, How LANs connected to Internet. Doublin...

How LANs connected to Internet. Doubling every 18 months means factor of four gains in 3 years. In 9 years, gain is then 43 or 64, which leads to 6.4 billion hosts. My intuitio

Show the rs232 logic waveform, Q. Show the RS232 Logic Waveform ? RS-2...

Q. Show the RS232 Logic Waveform ? RS-232 Interface Three most important wires for the Serial interface Transmit - Pin 2 Receive - Pin 3 Ground - Pin

What is meant by middleware, What is meant by Middleware? Middleware is...

What is meant by Middleware? Middleware is a distributed software needed to support interaction between clients and servers. In short, it is the software that is in the middle

What is manchester, Q. What is Manchester? - Utilizes an inversion at t...

Q. What is Manchester? - Utilizes an inversion at the middle of each bit interval for both synchronization and bit representation - Negative-to-positive represents binary 1

What are hold-downs used for, Hold-Down Timers - Routers ignore network upd...

Hold-Down Timers - Routers ignore network update information for a number of periods.

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