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 bit stuffing, What is Bit Stuffing? Bit stuffing is the process...

What is Bit Stuffing? Bit stuffing is the process of adding one extra 0 whenever five consecutive is follow a 0 in the data, so that the receiver does not mistake the pattern 0

What are the disadvantages of bus topology, What are the disadvantages of b...

What are the disadvantages of bus topology? The disadvantages of bus topology are: a. The bus networks are dissimilar to reconfigure, especially when the acceptable number o

Antenna Network of 16.4m Earth Station , (a ) Std "A" 16.4 m C-BAND EARTH ...

(a ) Std "A" 16.4 m C-BAND EARTH STATION (1996) This is the main system of this station and provides connectivity to most of the countries through dedicated transponder channe

Improvements for the wireline lan infrastructure, 5. CSMA/CD based Ethernet...

5. CSMA/CD based Ethernet LANs in various sites and Frame Relay (FR) service to connect them together. You want to make a difference in the organization by upgrading the LANs to be

Describe transport and tunnel mode in detail, Can you describe transport an...

Can you describe transport and tunnel mode in detail with datagram packets?

Distributed shared memory systems, Distributed Shared Memory (DSM) systems ...

Distributed Shared Memory (DSM) systems copy a shared memory abstraction on loosely coupled architectures in order to allow shared memory programming despite missing hardware suppo

Research, I have a research in this topic " Mitigating DoS Attacks against ...

I have a research in this topic " Mitigating DoS Attacks against Broadcast Authentication in Wireless Sensor Networks " with simulation

What is 100base-fx, 100Base-FX Utilizes two identical optical fiber...

100Base-FX Utilizes two identical optical fibers in star topology One fiber holds frames from the station to hub one from hub to station Encoding is 4B/5B Si

What are the possible ways of data exchange in ccna, Normal 0 f...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

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