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

Different kinds of host in multicasting, What are the different kinds of ho...

What are the different kinds of host in multicasting?

In formation sharing at regular intervals, In formation  sharing at  regu...

In formation  sharing at  regular intervals For example  every 30 seconds each router sends its information  about the  whole  network  to its  neighbours. This sharing  occurs

Configure the logical topology- ccna, Configure the Logical Topology S...

Configure the Logical Topology Step: Configure the host computers. Configure the static IP address, subnet mask, and gateway for every host computer.  Note: The followi

Additional bandwidth does each scheme require, Recalling two FEC schemes fo...

Recalling two FEC schemes for internet phone described. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-ra

Electronic mail - application layer, Electronic Mail One  of the  most...

Electronic Mail One  of the  most popular internet  services is electronic mail ( e mail). At  the beginning  of the internet era teh message sent by  electronic  mail were sh

Switching via memory - network layer and routing , Switching  via memory ...

Switching  via memory Traditional  computers with switching  between  input and output  being  doen under  direct  control  of the CPU input and output  ports  functioned as tr

Types of topologies, TWO DIFFERENT KINDS OF TOPOLOGIES: LOGICAL TOPOL...

TWO DIFFERENT KINDS OF TOPOLOGIES: LOGICAL TOPOLOGY:  It is described by the specific network technology. PHYSICL TOPOLOGY: It relays on the wiring scheme. NE

Two types of transmission technology , What are the two types of Transmissi...

What are the two types of Transmission Technology available in ccna? Ans) Point - to - Point and Broadcast are the Two types of Transmission Technology available in CCNA

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