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 beaconing, What is Beaconing? The process that permits a networ...

What is Beaconing? The process that permits a network to self-repair networks problems. The stations on the network notify the other stations on the ring when they are not rece

How to prevent the data from hackers, How to prevent the data from hackers ...

How to prevent the data from hackers In order to prevent intruders from entering the house, it is necessary for the house owner to look after the behaviour of internal and exte

Illustrate about OSI architecture, Explain ISO's OSI Architecture The O...

Explain ISO's OSI Architecture The Open System Interconnection (OSI) is a standard reference model for communication among two end users in a network. It is used in developing

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

Simple mail transfer protocol ( smtp), Simple Mail Transfer Protocol ( SMTP...

Simple Mail Transfer Protocol ( SMTP) SMTP is the principal  application layer protocol for  internet electronic  mail. It uses the reliable data transfer  service of TCP  to

When the router runs out of buffer space, Source quench is the process wher...

Source quench is the process where the destination router, or end internetworking device will "quench" the date from the "source", or the source router. This usually occurs when th

Ajax, Ajax is a relatively new set of techniques that, in a sense, implemen...

Ajax is a relatively new set of techniques that, in a sense, implement some of the functionalities originally provided by RPC. Ajax is primarily used to build web applications with

Connect a router and computer with a console cable- ccna, Connect a Router ...

Connect a Router and Computer with a Console Cable Step 1 : Set up a basic physical connection. Connect the console (rollover) cable to the console port on the router. Link

Implementation of distributed systems, Distributed systems are composed of ...

Distributed systems are composed of a number of physically separate machines connected by one or more communication links. Unlike parallel systems, there's no shared clock or memor

What is d-amps, What is D-AMPS D-AMPS uses 832 channels (in every dire...

What is D-AMPS D-AMPS uses 832 channels (in every direction) with three users sharing a sole channel. This allows D-AMPS to support up to the 2496 users simultaneously per cel

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