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

Modern computer , modern technology in world of 21 century

modern technology in world of 21 century

What is the virtual path, Along any transmission path from a given source t...

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is known as path.

Describe virtual channel, What is virtual channel? Virtual channel is n...

What is virtual channel? Virtual channel is normally a connection from one source to one destination, although multicast connections are also allowed. The other name for virtua

What is multicast routing, What is multicast routing? Sending a message...

What is multicast routing? Sending a message to a group is known as multicasting, and its routing algorithm is known as multicast routing.

Subnetting ip addresses, Explain everything you can tell from the following...

Explain everything you can tell from the following: a. 00-01-00-01-13-FD-F4-C0-00-1E-33-92-CE-99 b. fe80::2c1e:18af:749b:91c5%12 c. 2002:8b64:6e3a::8b64:6e3a d. ::0

Describe flow and error control mechanisms, Q. Describe Flow and Error Cont...

Q. Describe Flow and Error Control Mechanisms? Flow and Error Control Mechanisms - Stop and Wait ARQ - Go-Back ARQ - Selective Repeat ARQ

Explain data processing, Question - 1 Define MIS and its objectives. What ...

Question - 1 Define MIS and its objectives. What are the characteristics of MIS? Question - 2 Explain data processing Question - 3 What are the recent developments in database

What are the key elements of protocols, What are the key elements of protoc...

What are the key elements of protocols? The key elements of protocols are a. Syntax   It refers to the structure or format of the data that is the order in which they a

Name the 10base5 connectors, 10Base5 Connectors Transceiver - inter...

10Base5 Connectors Transceiver - intermediary device as well called a medium attachment unit (MAU) Performs CSMA/CD function may perhaps contain small buffer Atta

Advanced interface module and system bus, Advanced Interface Module (AIM) s...

Advanced Interface Module (AIM) socket This is an 100 pin internal socket. It is provide for plug in the Advance interface module card. Purpose of AIM card is concentrate in th

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