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 are the characteristics of client, What are the characteristics of Cli...

What are the characteristics of Client/Server? Service Encapsulation of services Shared resources Asymmetrical protocols Mix-and-match Transparency of location

TRAFFIC CONGESTION ASSESSMENT, Can I get help for traffic congestion anlysi...

Can I get help for traffic congestion anlysis using GIS

Threats to information can include, Threats to information can include ...

Threats to information can include Deletion of a file or files. Corruption, caused either by hardware problems or by a bug in the software. Theft of company data

Command to view the configuration-register value, Recognize the command to ...

Recognize the command to view the configuration-register value Ans) show version is the command to view the configuration-register value

What is sliding window, What is Sliding Window? The sliding window is a...

What is Sliding Window? The sliding window is an abstract method that explains the range of sequence numbers that is the concern of the sender and receiver. In other words, he

Give the examples of the session layer, Session layer examples  are Netbios...

Session layer examples  are Netbios Names, SQL, NFS, X Windows, and RPC.

What is a link, What is a Link? A link refers to the connectivity among...

What is a Link? A link refers to the connectivity among two devices. It contains the type of cables and protocols used in order for single device to be able to communicate with

Top level domain servers, TOP Level Domain  (TLD) Servers These  serve...

TOP Level Domain  (TLD) Servers These  servers are responsible  for top  level  domains such  as com org net edu, and  going  and all  the country  top level  domains  such  a

What is explicit congestion signalling, What is Explicit congestion signall...

What is Explicit congestion signalling In general way, for explicit congestion avoidance, the network alerts end systems to growing congestion within the network and the end sy

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