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

What is star topology, Star Topology   Devoted point-to-point links to...

Star Topology   Devoted point-to-point links to central controller (hub)   Controller acts like exchange   Advantages - Less expensive - Robustness   Disadv

What is sockets, A socket is an abstraction that shows an endpoint of commu...

A socket is an abstraction that shows an endpoint of communication. Most applications that consciously use TCP and UDP do so by making a socket of the appropriate type and then per

Horizontal scaling and vertical scaling, What is meant by horizontal scalin...

What is meant by horizontal scaling and vertical scaling? Ans) Horizontal scaling means adding or removing client workstations with only a small performance impact. Vertical

Virtual lans, One of the design requirements is to isolate other network tr...

One of the design requirements is to isolate other network traffic and broadcast from finance department to improve security. In order for this to possible we will implement VLAN o

Advantages and disadvantages of public and private network, The disadvantag...

The disadvantages and advantages of Private and Public networks are shown in the table below:

What are the disadvantages of star topology, What are the disadvantages of ...

What are the disadvantages of Star Topology? The disadvantages are considered as follows: a. Needs more cable than most topologies. b. Moderately complex to install.

Explain categorization according to pipeline configuration, Categorization ...

Categorization according to pipeline configuration According to the configuration of a pipeline, the below categories are recognized under this classification: Unifunct

Determine three features of igrp, GRP uses a composite metric complete up o...

GRP uses a composite metric complete up of bandwidth and delay by default, it updates each 60 Seconds and will trigger an update if the topology changes.

Explain systolic array interconnection networks, Systolic Array : This inte...

Systolic Array : This interconnection network is a kind of pipelined array architecture and it's intended for multidimensional flow of data. It is used for applying fixed algorithm

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