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

Integrated services digital network service, The entire idea of ISDN is to ...

The entire idea of ISDN is to digitize the telephone network to allow the transmission of video, audio and text over existing telephone lines. The reason of the ISDN is to provide

Which layer defines bit synchronization, Physical layers defines with synch...

Physical layers defines with synchronizing the 1s and 0s on the wire.

Explain about the switches, Explain about the Switches LAN switches are...

Explain about the Switches LAN switches are an expansion of the method in LAN bridging, which controls data flow, handles transmission errors, gives physical addressing, and ma

Define virtual channel, Virtual channel is normally a link from one source...

Virtual channel is normally a link from one source to one destination, although multicast connections are also allowed. The other name for virtual channel is virtual circuit.

Distributed data processing, In distributed data processing, explain two sc...

In distributed data processing, explain two scenarios where vertical partitioning and horizontal partitioning are used. Distributed Data Processing The distributed data pro

Application layer - fundamentals of networks, Application Layer The ap...

Application Layer The application layer provides  an  interface between  application  entities and the  users computer. This layer offers services to a variety of aspects of d

What is mesh network, What is mesh network? A network in which there ar...

What is mesh network? A network in which there are many network links among computers to provide multiple paths for data to travel.

What is remote procedure call, What is Remote Procedure Call (RPC)? RPC...

What is Remote Procedure Call (RPC)? RPC hides the intricacies of the network by using the ordinary process call mechanism familiar to every programmer. A client process calls

Explain anti-aliasing techniques, Question: (a) Explain the issue assoc...

Question: (a) Explain the issue associated with vertices when the scan line scan line polygon fill algorithm is being applied? (b) Explain the logic of shortening edges to a

Chord, how to implement chord connection as the network management system ?...

how to implement chord connection as the network management system ?

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