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

What is on electronic payment system, What is on electronic payment system?...

What is on electronic payment system? Electronic payment systems are alternative cash credit payment methods using several electronic methods to pay for products and services in

Telnet protocols - transport layer, TELNET Protocols The TCP/ IP proto...

TELNET Protocols The TCP/ IP protocol  suite  includes a simple textual  remote terminal protocols called  TELNET  that allow  a user to log into  a computer across an interne

Command structure in distributed enrollment protocol , Command Structure: ...

Command Structure: Commands are all-upper-case strings, either 4 or 6 characters in length. Table 1 shows the commands, and (for method commands) the parameters, return values, ex

Determine the use of icon, Determine the use of Icon A small picture...

Determine the use of Icon A small picture or graphic used to represent a location in the inter- or Intranet (for example a flow-chart graphic to take the user to the departm

How to prepare the network- ccna, Prepare the Network Cable a network ...

Prepare the Network Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has the needed interfaces

What are the drawbacks of arcnet, What are the drawbacks of ARCNet? Her...

What are the drawbacks of ARCNet? Here are some drawbacks of ARCNet: 1.  Standard ARCNet is very slow (2.5 Mb/s). It is almost seven times slower than Token Ring. 2.  ARC

Objective of parallel algorithms, After studying this part the students wil...

After studying this part the students will be able to understand about the following: Analysis of Parallel Algorithms; Different Models of Computation; o   Interco

What is a protocol, What is a protocol? The term protocol refers to a s...

What is a protocol? The term protocol refers to a set of rules and process that govern the transmission of messages over a physical networking medium. The most common network p

List some most useful advantages of token ring, List some most useful advan...

List some most useful advantages of Token Ring. Here are Token ring's most useful advantages: a. It depends excellent throughput under high-load conditions. b. Token Ring

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