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

Modem stands for modulator - demodulator, Q. Modem stands for modulator - d...

Q. Modem stands for modulator - demodulator ? - Modulator are to creates an analog signal from binary data - Demodulator are to recovers the binary data from the modulated s

Define the bulletin board intranet, Define the Bulletin Board Intranet ...

Define the Bulletin Board Intranet This type of Intranet in an organisation extends to everyone the capability to review or update information that would normally be placed

Describe about the server and browser software, Describe about the Server a...

Describe about the Server and browser software Most of the server and browser software developed by various vendors carry out encryption using either a 40-bit or a 128-bit sec

What is meant by asymmetrical protocols, There is a many-to-one relationshi...

There is a many-to-one relationship among clients and server. Clients always start the dialog by requesting a service. Servers are passively awaiting for requests from clients.

Firewall architectures-screened host architecture, Screened Host Architectu...

Screened Host Architecture This architecture consists of two host machines: a Screening Router and a Screening Host. Screening Router is placed between a local network and the

Illustrate nonboundary-level masking with example, Q. Illustrate Nonboundar...

Q. Illustrate Nonboundary-Level Masking with example? Nonboundary-Level Masking Example IP address 45 123 21 8 Mask 255 192 0 0 Subnet 45 64 0 0 123 0

Application layer - fundamentals of networks, Application Layer The ap...

Application Layer The application layer provides  an  interface between  application  entities and the  users computer. This layer offers services to a variety of aspects of d

Assigment, what the domain name of 128.252.160.2000

what the domain name of 128.252.160.2000

What do you understand by service access point, Q. How two adjacent layers ...

Q. How two adjacent layers communicate in a layered network or what do you understand by Service Access Point? Ans: In layered network, each layer has several entities and enti

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