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

Elaborate the term - database connectivity, Elaborate the term - Database C...

Elaborate the term - Database Connectivity Basic connectivity A number of database management systems are available today such as the Oracle, Sybase, Ingres, etc. Most

Communication protocol - internet protocol, The Internet protocol mentions ...

The Internet protocol mentions the rules that describe the details of how computers communicate. It exactly mentions how a packet should be formed & how a router should forward eac

Arrays pointers for parallel algorithms, Arrays Pointers An array is a ...

Arrays Pointers An array is a set of the same type of data. Arrays are very well-liked data structures in parallel programming due to their easiness of use and declaration. At

How an ethernet worked, How an Ethernet Worked? The operation of Ethern...

How an Ethernet Worked? The operation of Ethernet can be explained in simple terms as follows: Each computer on the Ethernet Network, also called as a node, operates indepen

What are some drawbacks of implementing a ring topology, What are some draw...

What are some drawbacks of implementing a ring topology? In case one workstation on the network varies a malfunction, it can bring down the whole network. Another drawback is t

Wide area network wan- fundanentals of networks, Wide Area Network WAN ...

Wide Area Network WAN Wide  Area Network  ( WANs) connect larger geographic  areas such as  London the UK or the  world. In this types  of networks  dedicated transoceanic cab

Thick ethernet wiring, THICK ETHERNET WIRING:  It needs thick coax cab...

THICK ETHERNET WIRING:  It needs thick coax cable. AUI cable joins from NIC to transceiver. AUI cable take digital signal from NIC to transceiver. The transceiver creates anal

Merge sort circuit, First, split the given series of n numbers into two par...

First, split the given series of n numbers into two parts, each consisting of n/2 numbers. After that, recursively split the series into two parts until each number acts as an inde

In formation sharing at regular intervals, In formation  sharing at  regu...

In formation  sharing at  regular intervals For example  every 30 seconds each router sends its information  about the  whole  network  to its  neighbours. This sharing  occurs

Briefly describe the purpose of windows powershell, Question: a) Brief...

Question: a) Briefly describe the purpose of Windows Powershell? b) Name ways software can be installed on Linux? c) What is an interrupt request? d) As the Networ

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