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

Iso - organization for standardization, - The ISO (International Organisati...

- The ISO (International Organisation for Standardisation) is an International standards organisation responsible for a wide range of standards including many that are relevant to

Speed up with metrics for performance evaluation, Speed Up:- Speed up i...

Speed Up:- Speed up is the ratio of the time required to implement a given program using a definite algorithm on a machine with one processor (i.e. T (1) (where n=1)) to the ti

Security goals confidentiality- integrity- digital signature, Question 1   ...

Question 1   This question concerns the main security goals (confidentiality, integrity, availability). Describe a situation which provides the goal of confidentiality but does not

A default route is analogous to a, A default route is analogous to a defaul...

A default route is analogous to a default gateway. It is used to decrease the length of routing tables and to give complete routing capabilities when a router may not know the rout

Wireless Networks, Is a complete OSI/TCPIP network architecture available i...

Is a complete OSI/TCPIP network architecture available in MATLAB?

Network management assignment, One of the key roles of a System/Network Adm...

One of the key roles of a System/Network Administrator is to monitor log files. This usually requires helper scripts (i.e. Perl programs) so a summary of large log files can be qui

Advantages - point to point , Advantages There are  times when  using ...

Advantages There are  times when  using  packet filters makes  sense. If the  connections require high  throughput  or the protocols  has proprietary technology that makes  it

Options - transport layer, Options The options  fields may be  used to...

Options The options  fields may be  used to  provide  other functions that are not  covered by  the header. If the length  of the  options  field is not  a multiple of 32 bits

What is synchronous tdm, What is Synchronous TDM? In STDM, the multiple...

What is Synchronous TDM? In STDM, the multiplexer allocates exactly the same time slot to every device at all times, whether or not a device has anything to transmit.

What is the difference between a hub and a switch, What is the difference b...

What is the difference between a hub and a switch? A hub acts as a multiport repeater. Though, as more and more devices connect to it, it would not be able to efficiently manag

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