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

Dns cache poisoning, DNS cache poisoning The DNA cache poisoning gener...

DNS cache poisoning The DNA cache poisoning generally refers to the process of maintaining or developing the false information, in the cache of DNS server. This process refers

Explain the different types of physical networking, Question 1 Explain the...

Question 1 Explain the different activities carried out on E-Commerce, with appropriate examples Question 2 Explain the core components of E-Commerce in detail with appropria

Write the definition of SAN, Write the definition of SAN A SAN is a sep...

Write the definition of SAN A SAN is a separate network to handle storage requirements. The SAN detaches storage tasks from specific servers and makes a shared storage facility

Subletting, Ask Design private subnetworks (using Class A range for CIDR) f...

Ask Design private subnetworks (using Class A range for CIDR) for each domain as in the table below, and complete the table. Hints: Consider how many network bits are required to a

What are the functions of the typical server program, What are the function...

What are the functions of the typical server program? It waits for client-initiated requests. Executes many requests at the same time. Takes care of VIP clients first. Initiate

Deadlock avoidance or prevention, Deadlock Avoidance To avoid deadlock...

Deadlock Avoidance To avoid deadlocks two types of strategies are used: 1) Static prevention: It uses V and P operators and Semaphores to allocate and deallocate shared res

Internet client control task, Internet Client Control Task A distribut...

Internet Client Control Task A distributed system is to be implemented using networked PCs. The role of the system in this task is to implement an environmental control sys

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

Odd-even transposition algorithem, Algorithm:  Odd-Even Transposition //...

Algorithm:  Odd-Even Transposition //Input: N numbers that are in the unsorted form //Assume that element bi is assigned to pi for I=1 to N { If (I%2 != 0) //i.e Odd

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