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 do you understand by protocol, Q. What do you understand by Protocol? ...

Q. What do you understand by Protocol? Ans:  In the context of data networking, a protocol is a formal set of rules and conventions that governs how computers interchange infor

Hierarchical addressing and routing, The steps of forwarding the packets of...

The steps of forwarding the packets of information is known routing. The information about receivers is saved in routing tables. Note that several entries have same next hop. It is

Determine the level of fibre channel standard, Determine the level of Fibre...

Determine the level of Fibre Channel standard The Fibre Channel standard is organized into five levels: FC-0: The Physical Interface and Media Level handles a variety of phy

Application of internet control message protocol, The application for this ...

The application for this assignment is somewhat arti?cial. Normally, an application would not interact directly with IP. Instead, it would create a UDP or TCP socket and interact w

What is the purpose of a default route, A default route is used if there is...

A default route is used if there is not a particular entry in the routing table for the destination.

Calculate the modulation index and find the bandwidth, Consider a signal x(...

Consider a signal x(t) = 10 cos(2πfct + 4 cos 2πfmt). Assume frequency modulation. The message frequency fm = 2:3 kHz. Calculate the modulation index and find the bandwidth when

Dynamic process groups in parallel virtual machine , Dynamic Process Groups...

Dynamic Process Groups To generate and manage dynamic groups, a separate library libgpvm3.a must be connected with the user programs that make use of any of the set functions.

Hierarchical routing strategy, i want a program of hierarchical programming...

i want a program of hierarchical programming in c language with its output. please help me .

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

What are the functions of the typical server program? Ans) It waits for client-initiated requests. Implements many requests at the similar time. Takes care of VIP clients first.

What do you mean by platform independence, What do you mean by platform ind...

What do you mean by platform independence? Platform independence means that we can write and compile the java code in one platform (eg Windows) and can implement the class in a

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