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

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.

Tcp segment structure - transport layer, TCP Segment Structure Figure ...

TCP Segment Structure Figure shows the format of the TCP segment. The  header consists  of a 20 bytes  fixed  part  plus a variable size  options fields. The description  o

Define the concept of repeaters, Can you define the concept of Repeaters, H...

Can you define the concept of Repeaters, Hubs, Bridges, Switches and Routers?

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.

Illustrate 802.11b HR DSSS, 802.11b HR DSSS a) High-rate DSSS using a ...

802.11b HR DSSS a) High-rate DSSS using a 2.4 GHz band b) Similar to DSSS excluding for encoding method c) Uses complementary code keying (CCK), encoding 4 or 8 bits to

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

Security - fundamentals of networks, Security Security  is the  protec...

Security Security  is the  protection of hardware software and data  from  unauthorized access. Restricted physical  access to computer password protection limiting  user priv

Icmp process, Some of the ?elds of IP and ICMP datagrams will be ?xed, some...

Some of the ?elds of IP and ICMP datagrams will be ?xed, some will be settable by the application, and others will computed according to the situation. You must set all ?elds of th

What is parabolic dish antenna, Q. What is Parabolic Dish Antenna? - In...

Q. What is Parabolic Dish Antenna? - Incoming signals means that the Signal bounces off of dish and is directed to focus - Outgoing signals signifies transmission is broadca

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