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 net stat, What is net stat? Netstat is a command line utility p...

What is net stat? Netstat is a command line utility program. It gives useful information about the current TCP/IP settings of a connection.

Difference among flow control and error control, What is the difference am...

What is the difference among  flow control and error control?    Ans) Flow control: adjust and confirm data flow rate for successful transmission. Error Control: a method to

Distinguish cisc and risc, Question 1 Distinguish CISC and RISC Question ...

Question 1 Distinguish CISC and RISC Question 2 Write a short note on Asynchronous Transfer Mode of transmission Question 3 Explain various client/server applications using Ja

What is the purpose of a default route, A default route is used if there is...

A default route is used if there is not a particular entry in the routing table for the destination.

Routing by rumor, What is the major issue with routing by rumor?

What is the major issue with routing by rumor?

Define router. explain its type, Question 1 Define Router. Explain its typ...

Question 1 Define Router. Explain its type Question 2 List and discuss the different concepts of EIGRP Question 3 Explain the concept of autonomous system Autonomo

Advantages - point to point , Advantages There are  times when  using ...

Advantages There are  times when  using  packet filters makes  sense. If the  connections require high  throughput  or the protocols  has proprietary technology that makes  it

8088, 8088 pin diagram

8088 pin diagram

What is stop-and-wait protocol, What is Stop-and-Wait Protocol? In Stop...

What is Stop-and-Wait Protocol? In Stop and wait protocol, sender sends single frame, waits unless it receives confirmation from the receiver (okay to go ahead), and then sends

Password authentication protocols (pap), Password Authentication Protocols ...

Password Authentication Protocols (PAP) PAP  implements the  traditional username and password  authentication methods. At the  request from  an authenticator the client respon

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