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 the computing infrastructure, Determine the computing infrastruct...

Determine the computing infrastructure One solution for the protection of the computing infrastructure is to use digital certificate-based solutions. Users can be given access

What is the difference between trigger and rule, What is the difference bet...

What is the difference between trigger and rule? The triggers are known as implicitly by database generated events, whereas stored procedures are known as explicitly by client

Describe the count-to-infinity problem in distance vector, Describe the cou...

Describe the count-to-infinity problem in distance vector

Show the refraction and reflection in Fiber-optic cable , Q. Show the Refra...

Q. Show the Refraction and Reflection in Fiber-optic cable ? - Refraction often takes place when light bends as it passes from one medium to another less dense medium - Wh

Delivering message through lan, Delivering message through LAN: We hav...

Delivering message through LAN: We have to devise method for delivering message through LAN phase to single, specific destination device. Sending device uses a hardware addres

Analysis of parallel algorithms, A generic algorithm is mostly analyzed on ...

A generic algorithm is mostly analyzed on the basis of the following parameters: the time complexity (implementation time) and the space complexity (amount of space necessary). Usu

Characteristics of udp, UDP sends packets 'blind' down the network, and rel...

UDP sends packets 'blind' down the network, and relies on upper-layer protocols to form connections and identify errors. TCP is a connection-oriented protocol that can give reliabl

network consultant, Network Consultant, My name is Jason Long. I am th...

Network Consultant, My name is Jason Long. I am the CEO of IL Corporation. IL is an investment firm that performs financial services to many organizations. We currently have 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