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

Layers, what are the layers covered under end to end later connectivity?

what are the layers covered under end to end later connectivity?

Hardware difficulty, Hardware difficulty It refers to the price of hard...

Hardware difficulty It refers to the price of hardware logic like connectors, wires, switches, arbiter etc. that are required for execution of interconnection network.

Define the class B addresses, Define the Class B Addresses? First t...

Define the Class B Addresses? First two octets are the network number as well as the last two octets are the host number 16382 probable blocks for assignment to organi

Describe the sequence of events occur in host attempt, The following inform...

The following information was obtained from a host: IP address...............205.133.127.8/24 Default Gateway...... 205.133.127.1 DNS Server.............139.100.110.10

What is a protocol, What is a protocol? The term protocol refers to a s...

What is a protocol? The term protocol refers to a set of rules and process that govern the transmission of messages over a physical networking medium. The most common network p

Configure VTP Pruning on the Switches- CCNA, Configure VTP Pruning on the S...

Configure VTP Pruning on the Switche s VTP pruning allows a VTP server to suppress IP broadcast traffic for particular VLANs to switches that do not have any ports in that VLAN.

Deteemine token bus of 802.3, Token Bus Physical order of stations ...

Token Bus Physical order of stations doesn't matter Line is broadcast medium "Send" token by addressing neighbour Provisions for deleting, adding stations

What layer can optionally support reliability, Ans) The Transport Layer : ...

Ans) The Transport Layer : Segments upper-layer applications. Establishes an end-to-end connection. Sends segments from one end host to another. Optionally, make sures

Distributed system, You should develop a system consisting of an applicatio...

You should develop a system consisting of an application acting as a broker and several agents that need to communicate between them. The agents can only communicate in pairs (i.e.

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