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

Explanation of internetworking terms and concepts, Question: (a) Outlin...

Question: (a) Outline the main interactions that take place when a user requests a valid web resource in the Address Bar of a modern web client till the resource is eventually

Karnaugh map, Qustions: Simplify the following expression using a Karna...

Qustions: Simplify the following expression using a Karnaugh map: F = XY‾Z + X‾Y‾Z + XY Z +X‾ Y Z

What are the security models by giving striking analogies, Security models ...

Security models by giving striking analogies to the real world A classical case study: (With due acknowledgements to the security exponent who proposed this theory.) He has c

Lan- wan network module expansion slot, WAN interface card(WIC) slots T...

WAN interface card(WIC) slots Two fixed WIC slots are present in  2600 series router except 2691. It has contained 3 WIC slots. Network Module Expansion Slot( NM) slot

Simplicity - transport layer, Simplicity The advantage of this approa...

Simplicity The advantage of this approach is the simplicity  of receiver buffering. The  receiver need not  buffer out of  order packets the sender must maintain the upper an

Determine the working of communications intranet, Determine the working of ...

Determine the working of Communications Intranet Intranets of this type tend to feature in geographically dispersed organisations. The motivation for its implementation is g

Redundant routing information, Notice repetition of information in routing ...

Notice repetition of information in routing table for node 1 as given above in the figure. We can see that switch has only outgoing connection, all traffic must goes that connec

Difference between baseband and broadband transmission , What is difference...

What is difference between Baseband and Broadband Transmission in ccna? Ans) In a baseband transmission, the entire bandwidth of the cable is consumed by a one signal. In bro

What is the network time protocol, What is the Network Time Protocol? ...

What is the Network Time Protocol? A protocol that makes sures accurate local timekeeping with reference to radio and atomic clocks located on the Internet. This protocol is c

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