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

Assignment, Name the three ways or wireless data to be propagated.

Name the three ways or wireless data to be propagated.

Hardware component used to store buffers, Recognize the hardware component ...

Recognize the hardware component used to store buffers, tables, running-configuration etc? Ans) RAM is the dynamic memory area. ROM have the boot strap code, NVRAM have the star

Task of changing the ip address, 1. Bob has been given the task of changing...

1. Bob has been given the task of changing the IP address and enabling telnet access on a CISCO 2950 enterprise switch. The current IP address is 10.10.10.2/8 the new IP address

Transmission control protocol, Transmission Control Protocol (TCP) TCP ...

Transmission Control Protocol (TCP) TCP makes the Internet reliable. TCP solves several problems which can occur in a packet switching system. TCP provide the given facilities:

Explain the term instruction pipelines, Instruction Pipelines The strea...

Instruction Pipelines The stream of instructions in instruction execution cycle may be realized by a pipeline where overlapped executions of various operations are performed. T

Explain concept of permutation network, Concept Of Permutation Network ...

Concept Of Permutation Network In permutation interconnection networks the information transfer necessitates data transfer from input set of nodes to output set of nodes and po

Mesh, Mesh It is of two dimensional network.  In this every processi...

Mesh It is of two dimensional network.  In this every processing elements are arranged in a two dimensional grid. The processor are in rows i and column j are denoted by PEi

Ethernet interface on the cisco router , As a system administrator, you req...

As a system administrator, you require to set up single Ethernet interface on the Cisco router to permit for both sap and Novell-ether encapsulations. Which set of commands will ac

What is workstation, What is workstation? A workstation is a node in ne...

What is workstation? A workstation is a node in network that is more useful and can occur local information processing or graphics processing. A workstation generally has an in

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Ans) Routable protocols can work with a router and can be used to build huge networks. Non-Routable protocol

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