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

Iso - organization for standardization, - The ISO (International Organisati...

- The ISO (International Organisation for Standardisation) is an International standards organisation responsible for a wide range of standards including many that are relevant to

Show the class A addresses, Q. Show the Class A Addresses? Class A Add...

Q. Show the Class A Addresses? Class A Addresses Numerically the lowest Use merely one byte to identify the class type and netid Three bytes are obtainable

What is quantum computing, In quantum computing, we use the method of qubit...

In quantum computing, we use the method of qubits, superposition and coherence. A normal bit can be in only two states - 0 and 1. But a qubit it can be in 0, 1, or in the superposi

Which applications of computer network will be categorized, Q. What are the...

Q. What are the main categories based on which applications of computer network will be categorized? Ans: The main areas under which the applications for computer network will

Difference between authentication and deauthentication, Difference between ...

Difference between Authentication and Deauthentication Authentication: Used to establish the self of stations to each other. Deauthentication: This service is appealed whene

Power supply and cpu bus, CPU bus It is connect with various component...

CPU bus It is connect with various components of the system and  transformation of data between components.   Power Supply It is separate  external part of cisco rou

Achieving universal services, The purpose of internetworking is universal s...

The purpose of internetworking is universal service across heterogeneous networks. To give this service all computers, and routers have to agree to forward information from a sourc

Which layer is responsible for negotiating data transfer , Which layer is r...

Which layer is responsible for negotiating data transfer syntax? Ans) The Presentation layer does the following: Manages data representation conversions, or data transfer syntax

Show the process of mail delivery, Q. Show the process of Mail Delivery? ...

Q. Show the process of Mail Delivery? Mail Delivery -Consists of three stages -First stage - email goes from user agent to local server, where it is stored until it ma

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