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

Building distributed systems, Unfortunately, building real-life distributed...

Unfortunately, building real-life distributed systems is not easy. It is hard, for instance, to implement instructions such as "send this data structure to be processed on that com

Determine about the infrared spectrum, Determine about the infrared spectru...

Determine about the infrared spectrum (1) The spectrum for infrared is virtually unlimited, which shows the possibility of achieving extremely high data rates. (2) The infra

Logged into a router, You are logged into a router, what command would repr...

You are logged into a router, what command would represent you the IP addresses of routers linked to you? Ans)show cdp neighbors detail

Show the security policy as well integrated security, Q. Show the Security ...

Q. Show the Security Policy as well Integrated Security ? Security policy is on paper statement describing what assets are to be protected and why who is responsible and which

Layered concept of computer networks, Q1.  What  advantages  do  you  see  ...

Q1.  What  advantages  do  you  see  in  having  a  layered  concept  of  computer  networks?  Which layers or OSI structure deals with identification of a host? Explain the proces

State the uses of groupware, State the uses of groupware With the use o...

State the uses of groupware With the use of groupware, users can easily do most of the office related management work, which otherwise would be extremely difficult. For instanc

Operating system for server, Operating system for Server Since 1994, w...

Operating system for Server Since 1994, when the original pair of web servers - NCSA HTTPd and CERN HTTPd , were proposed, dozens of commercial and shareware programs have

Flash updates, IGRP uses flash updates, poison reverse updates, hold down t...

IGRP uses flash updates, poison reverse updates, hold down times, and divide horizon. How often does it broadcast its routing table updates? Ans) 90 seconds

Explain routing loop issue in rip protoco, Can you determine routing loop i...

Can you determine routing loop issue in RIP protocol?

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