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

How to protect computer hardware by threats, How to protect computer Hardwa...

How to protect computer Hardware by threats The first component in the computer system vulnerable to attacks or threats, and most important to be protected, is the hardware.

virtual private network - virtual private network vpns, Virtual private ne...

Virtual private network The virtual  private  networks takes the  user data  encrypts them and sends them  to their  destination over  the internet. the sender  and the receiv

Explain how snmp works, Question: a) One of the most important duties ...

Question: a) One of the most important duties of a system administrator is to protect the information that is stored on network servers. In the same context, describe both Ma

Network devices - network layer and routing , Network Devices a.Hub ...

Network Devices a.Hub b.Repeater c.Bridge d.Gateway e.Switch f.Router Connecting devices can  classified  into networking and internetworking  devices when

Chord, how to implement chord connection as the network management system ?...

how to implement chord connection as the network management system ?

What is the difference between csma/cd and csma/ca, What is the difference ...

What is the difference between CSMA/CD and CSMA/CA? CSMA/CD, or Collision Detect, retransmits data frames when a collision occurred. CSMA/CA, or Collision Avoidance, will first

Sole access protocol in parallel programming , Sole Access Protocol Th...

Sole Access Protocol The atomic operations, which have conflicts, are handled using sole access protocol. The process used for synchronization in this protocol is given below:

What is on electronic payment system, What is on electronic payment system?...

What is on electronic payment system? Electronic payment systems are alternative cash credit payment methods using several electronic methods to pay for products and services in

How a token ring networks allows sharing of bandwidth, Question: (a) E...

Question: (a) Explain how a Token Ring networks allows sharing of bandwidth (access control). (b) (i) CSMA/CD is not appropriate for wireless communication. Explain wh

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