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 called transactions, The grouped SQL statements are known as Trans...

The grouped SQL statements are known as Transactions (or) A transaction is a collection of actions embused with ACID properties.

State about the communications network, State about the communications netw...

State about the communications network 1) The communications network may only accept blocks of data up to a specific size.   (2) Error control might be more effective with a

What are the TCP services, Q. What are the TCP Services? TCP - Service...

Q. What are the TCP Services? TCP - Services Full Duplex Service Connection Oriented Service Reliable Service

Step to configure the host computers, Configure the Host Computers Ste...

Configure the Host Computers Step 1: Configure host computers. Configure the static IP address, subnet mask, and gateway for every host computer based on the configuration

Telecoms, What is a Multiplexor

What is a Multiplexor

What is topology, Q. What is Topology? - Physical/logical arrangement ...

Q. What is Topology? - Physical/logical arrangement - Topology of a network is the geometric depiction of the relationship of all the links and linking devices to one anothe

What is fiber distributed data interface, FDDI -(Fiber Distributed Data Int...

FDDI -(Fiber Distributed Data Interface) FDDI Basics: FDDI (Fiber Distributed Data Interface) came about because system managers became concerned with network reliability i

What is error detection, What is Error Detection? What are its methods? ...

What is Error Detection? What are its methods? Data can be corrupted during transmission. For reliable communication errors must be deducted and corrected. Error Detection uses

How to configure vtp pruning on the switches-ccna, Configure VTP Pruning on...

Configure VTP Pruning on the Switches VTP pruning permits a VTP server to suppress IP broadcast traffic for particular VLANs to switches that do not have any ports in that VLAN

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