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 are the compression protocols for ppp, The compression protocols for P...

The compression protocols for PPP are:- A. Stac   B. Predictor

The internet layer - fundamentals of networks, The Internet Layer The ...

The Internet Layer The  internet  layer is  responsible  for routing the data  packets  to the appropriate  destination. Internet protocol (IP) is responsible for ensuring dat

Determine the names of network installation, Determine the names of Network...

Determine the names of Network installation ? Buying the components ? Cabling the network ? Installation of networking components such as hubs, switches, routers, gateway

Determine control frame - set successor, Control Frame: set_successor ...

Control Frame: set_successor Station X wants to leave Successor S Predecessor P X sends set_successor frame to P With S as data field P changes its

Delay, It is a basic quantitative property of networks. Delay is a calculat...

It is a basic quantitative property of networks. Delay is a calculate how long it takes for a bit of data to cross across the network from one end to the other. It is calculated in

Processor arrangements-array, Processor Arrangements It is a very frequ...

Processor Arrangements It is a very frequent event in data parallel programming to group a number of processors to perform definite tasks. To reach this goal, HPF gives a direc

WIRELESS COMMUNICATION, how does the near/far effects infulence TDMA system...

how does the near/far effects infulence TDMA system?what happen CDMA system? what are countermeasures in TDMA system/

Advantages of configuring virtual local area network, Many benefits of conf...

Many benefits of configuring VLAN as listed below: • Performance Enhancements: It reduces heavy load on the network by permitting operations at lower latencies by using VLAN t

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