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

Describe the automatic repeat request protocol, Question 1: (a) In net...

Question 1: (a) In networking, there are different possible topologies. Explain the Linear bus, Ring and Star topology along with their advantages and disadvantages. (b) W

Why it is essential to have layering in a network, Q. Why it is essential t...

Q. Why it is essential to have layering in a network? Ans: A computer network is a very complicated system. It becomes very hard to implement as a single entity. The layered ap

Network layer of the osi responsible for, What is the Network Layer of the ...

What is the Network Layer of the OSI responsible for? Ans) The Network Layer routes data from single node to another sends data from the source network to the destination networ

Distributed route computation, In distributed routing computation, every pa...

In distributed routing computation, every packet switch calculates its routing table locally and transmit messages to the neighbors. It also updates information regularly. If a pac

What is the advantage of address sharing, What is the advantage of address ...

What is the advantage of address sharing? By using address translation instead of routing, address sharing gives an inherent security benefit. That's because host PCs on the In

Snort deployed in the dmz network, Let's consider the network shown in Figu...

Let's consider the network shown in Figure 1 where Snort is deployed. In Figure 1, why is Snort deployed in the DMZ instead of the Internal Network? In Figure 1, say True or

What is a java package, What is a Java package and how is it used? A J...

What is a Java package and how is it used? A Java package is a naming context for classes and interfaces. A package is used to make a separate name space for groups of classes

What is star topology, Star Topology   Devoted point-to-point links to...

Star Topology   Devoted point-to-point links to central controller (hub)   Controller acts like exchange   Advantages - Less expensive - Robustness   Disadv

Give some examples of private network addresses, Give some examples of priv...

Give some examples of private network addresses. 10.0.0.0 with a subnet mask of 255.0.0.0 172.16.0.0 with subnet mask of 255.240.0.0 192.168.0.0 with subnet mask of 255.2

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