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

Tools for digital sound, Tools for Digital Sound Sound is the oscillat...

Tools for Digital Sound Sound is the oscillation of pressure that propagates in the form of a wave. Sound waves are transmitted through some medium (solid, liquid, or gas); th

Give example of the physical layer, FDDI, Token Ring and Ethernet are all p...

FDDI, Token Ring and Ethernet are all physical layer framing standards.

Firewalls - point to point, Firewalls After several  security  related ...

Firewalls After several  security  related internet  newsgroups  started overflowing  with posts it becomes  clear something  hand to done to help  secure  networks. The first

Determine about the tcp/ip and osi model, Determine about the TCP/IP and OS...

Determine about the TCP/IP and OSI model Both models are based on the layered protocols. Both comprise network, transport and application layer. In both the models, transport s

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

What are the different kinds of host in multicasting?

What are some drawbacks of implementing a ring topology, What are some draw...

What are some drawbacks of implementing a ring topology? In case one workstation on the network varies a malfunction, it can bring down the whole network. Another drawback is t

Determine the concept of placing antenna on hieght, Determine the concept o...

Determine the concept of placing antenna on hieght First, starting deployment simply placed cells in regions where there was high density of vehicle or human population. Once t

What is the meaning of p-persistent, What is the meaning of P-persistent ...

What is the meaning of P-persistent If the medium is idle, transmit with probability p, and delay one time unit with probability (1 - p); if the medium is busy, continue to lis

IP address, what is variable ip address

what is variable ip address

Subnetting (EIGRP), #questiGE 1-A Objectives: • Consolidate EIGRP knowle...

#questiGE 1-A Objectives: • Consolidate EIGRP knowledge. • Introduce the Route Redistribution concept. • Introduce the EIGRP External Routes concept. • Introduce the Default Met

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