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

Hyper cube, Hyper Cube A Hypercube interconnection network is increamen...

Hyper Cube A Hypercube interconnection network is increament  of cube network. Hypercube interconnection network for n ≥ 3, can be distinct recursively as follow: For n = 3,

Service paradigm, At the minimum level most networks sends individual packe...

At the minimum level most networks sends individual packets of data and the network needs each packet to follow an exact format dictated by the hardware, which is known service par

Network devices - network layer and routing , Network Devices a.Hub ...

Network Devices a.Hub b.Repeater c.Bridge d.Gateway e.Switch f.Router Connecting devices can  classified  into networking and internetworking  devices when

The size of a broadcast domain, Which switching technology can decrease the...

Which switching technology can decrease the size of a broadcast domain? Ans) VLAN's are logical ways to break up a huge broadcast domain. To get from VLAN to VLAN you must ha

Difference between multiprogramming and multithreading, Question: a) L...

Question: a) List three characteristics and two potential problems of a peer-to-peer environment. b) List three characteristics and two potential problems of a client/

Determine about the complete and proper security, Determine about the Compl...

Determine about the Complete and proper security Complete and proper security configuration and administration is indeed a complex issue. One should think carefully about the

Encrypt and decrypt message cryptography, Submission instructions: Answer ...

Submission instructions: Answer the following questions using a text processing software and submit your answers via connex. Possible file formats for your submission file(s) are .

Explain clustering support, Explain clustering support Clustering suppo...

Explain clustering support Clustering support refers to the ability of a network operating system to link multiple servers in a fault-tolerant group. The main purpose of this i

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