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 anonymous ftp, What is anonymous FTP? Anonymous FTP is a wa...

What is anonymous FTP? Anonymous FTP is a way of granting user access to files in public servers. Users that are permitted access to data in these servers do not require identi

Describe a typical dns system, Question: (a) With the help of a diagra...

Question: (a) With the help of a diagram, describe a typical DNS system. (b) Using signal sequence or state transition diagrams, illustrate the following scenarios: i.

Name the two types of oltp, a) TP lite , based on stored procedures. b)...

a) TP lite , based on stored procedures. b) TP heavy , based on the TP monitors.

Wireless Networks, Is a complete OSI/TCPIP network architecture available i...

Is a complete OSI/TCPIP network architecture available in MATLAB?

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

The ip addressing scheme, An Internet address (IP address) is a unique 32-b...

An Internet address (IP address) is a unique 32-bit binary number given to a host and used for all interaction with the host. Each packet transmit across an Internet contains the 3

What is a counter, What is a Counter A software code that indicates ...

What is a Counter A software code that indicates how many times a site has been visited. It gets automatically updated and is usually represented by a small rectangle with n

What is nos, What is NOS? NOS, or Network Operating System, are special...

What is NOS? NOS, or Network Operating System, are specialized software whose major task is to give network connectivity to a computer in order for it to be able to converse wi

Options negotiation - transport layer, Options Negotiation To use any ...

Options Negotiation To use any of the options first  requires option  negotiation between the client  and server. Four  control  characters are used for  this purpose.

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