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

Explain the term ftp- file transfer protocol, Explain the term FTP: File T...

Explain the term FTP: File Transfer Protocol A very common method of moving files between two Internet sites. FTP is a special way to log in to another Internet site for pur

R-sat networks for pstn and stm v-sat network, S t d "B" 9 m C-BAND EARTH...

S t d "B" 9 m C-BAND EARTH STATION (2001)   This  Earth  Station  is  aligned  with  INTEL  SAT  IOR  66°  and  provide domestic connectivity. R-Sat (Regional Satellite) i

What is bookmark, What is Bookmark A list of pages a user likes to f...

What is Bookmark A list of pages a user likes to frequently visit. Netscape® Navigator and Explorer® have a "bookmark" menu item which allows users to add favourite sites vi

Explain how contract net works, Question 1 Contract Net Protocol is the...

Question 1 Contract Net Protocol is the best known and most widely used cooperation protocol Explain how contract net works Discuss the benefits and limitations of con

Explain about nonboundary-level masking, Q. Explain about Nonboundary-Level...

Q. Explain about Nonboundary-Level Masking? Nonboundary-Level Masking Bytes in the IP address that correspond to 255 in the mask will be repeated in the subnet addres

Threats to information can include, Threats to information can include ...

Threats to information can include Deletion of a file or files. Corruption, caused either by hardware problems or by a bug in the software. Theft of company data

Process server, Using a process server (such as inetd or xinetd) to listen ...

Using a process server (such as inetd or xinetd) to listen on a set of well-popular ports and start one another server.  I said that it had much to do with overhead.  Say you set u

Matlab chi square functioning, Create a custom chi-square function in matla...

Create a custom chi-square function in matlab, MATLAB in Statistics

Explain the concept of router-root path, Explain the concept of router-root...

Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa

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