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

Post office protocols version - application layer, Post Office  Protocols ...

Post Office  Protocols Version In computing  the post office protocol  version 3 (POP3) is an  application layer internet standard  protocols  used by  local e mail  clients

Name the categories of multiplexing, Name the categories of Multiplexing? ...

Name the categories of Multiplexing? There are three categories of multiplexing a. Frequency Division Multiplexing (FDM) b. Time Division Multiplexing (TDM)    i. Sync

How many cables are needed, QUESTION a) List the seven layers of the IS...

QUESTION a) List the seven layers of the ISO-OSI model and briefly describe the role of each layer b) Describe the functions of the following intermediate systems- Rep

Advantage of ip sec tunnelling mode, Advantage of IP sec  Tunnelling Mode ...

Advantage of IP sec  Tunnelling Mode IP Sec  tunnelling mode  has the  following  advantages: a.Security : Ts IP sec tunnelling mode  secure somewhat but  not the best. In a

Openmp in shared memory programming, OpenMP is a compiler directive based s...

OpenMP is a compiler directive based standard developed in the late 1990s jointly by a group of main computer hardware and software vendors. It is portable across a lot of popular

CCNA, What is basic purpose of Routers

What is basic purpose of Routers

Wireless transmission, what are the main problems of signal propagation?why...

what are the main problems of signal propagation?why do radio waves not always follow a straight line?why is reflection both useful and harmful?

Bit stream structure, In OSI 7 layer model, a header, or possibly a trailer...

In OSI 7 layer model, a header, or possibly a trailer, can be added to the data unit at each layerI 7 layer, but we will define a simple virtual packet which contains only 8bit dat

What is dos, What is DoS? A do, or Denial-of-Service attack, is an atte...

What is DoS? A do, or Denial-of-Service attack, is an attempt to stop users from being able to access the internet or any other network services. Such attacks might be come in

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