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 models of computation-parallel algorithms, There are various comp...

There are various computational models for representing the parallel computers. In this part, we discuss various models. These models would give a platform for the designing as wel

Reliability probability of success, Reliability is the probability of succe...

Reliability is the probability of success ; where success is defined as compliance to specified requirements. A system or an item is considered reliable if it performs satisfactori

Designing an internet work, 1. Introduction This document describes t...

1. Introduction This document describes the research-based assignment for this module. This assignment consists of two parts: A formal report And a presentatio

Explain the concept of fragmentation, Fragmentation - Wireless environm...

Fragmentation - Wireless environment is very noisy - Corrupt frames must be retransmitted - Large frames must be divided into smaller ones to increase efficiency

Mechanical characteristics of RS232 interface, Q. Mechanical Characteristic...

Q. Mechanical Characteristics of RS232 interface? - 9-pin connector - 9-pin connector is more usually found in IBM-PC but it covers signals for asynchronous serial com

What are the responsibilities of application layer, What are the responsibi...

What are the responsibilities of Application Layer? The Application Layer enables the user, whether human or software, to access the network. It gives user interfaces and suppo

Illustrate about sliding window protocols, Q. Illustrate about Sliding Wind...

Q. Illustrate about Sliding Window Protocols? - Sliding window - Keeps the unacknowledged outstanding frames in sender - Keeps the expected frames in receiver - Sequen

Networking device, what is the best time to use brouter rather than router?...

what is the best time to use brouter rather than router? what are advantages of using brouter over router?

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