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

Determine in detail about the world wide web, Determine in detail about the...

Determine in detail about the world wide web The latest has been Web commerce that is currently making big news, and many businesses are setting up electronic shops on the Inte

What is intranet security, What is Intranet security Every company star...

What is Intranet security Every company starts its operations with a genuine and honest thinking. As time passes, based on the needs of its employees as well as customers, a nu

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

What are instance variables, What are instance variables? Instance vari...

What are instance variables? Instance variables are those which are explained at the class level. Instance variables require not be initialized before using them as they are au

Summary of osi model, Q. Summary of osi model? - There was no standard ...

Q. Summary of osi model? - There was no standard for networks in the early period and as a result it was difficult for networks to communicate with each other. - The ISO (In

Explain the term hardware cost, Hardware Cost It indicates to the cost ...

Hardware Cost It indicates to the cost concerned in the functioning of an interconnection network. It comprises the cost of arbiter unit, connectors, switches, interface logic

Determine the switch in a physical ring, Switch In a physical ring ...

Switch In a physical ring configuration any disabled or else disconnected node can disable the entire network Use of a switch can permit the ring to bypass an inactive

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

Define routing, Define Routing? The process of determining systematical...

Define Routing? The process of determining systematically hoe to forward messages toward the destination nodes based on its address is known as routing.

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