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

Mpi functions and environment, MPI contains hundreds of functions, a small ...

MPI contains hundreds of functions, a small subset of which is enough for most practical purposes. We shall talk about some of them in this unit. Functions for MPI Environment:

What are challenges of electronic commerce, Question 1: (a) In the con...

Question 1: (a) In the context of an information system, distinguish and relate among the terms: data, information and decision-making. (b) Describe at least two chall

Define carrier sense multiple access collision avoidance, Carrier Sense Mul...

Carrier Sense Multiple Access/Collision Avoidance a) Necessary since wireless LANs cannot implement CSMA/CD b) Collision detection requires increased bandwidth requirements

Create and simulate a network - netml system, Create and simulate a network...

Create and simulate a network similar to the one shown here, using the NetML system. The network is a little more complex, as depicted at the right. There is an extra node

What is mac address in networking, What is MAC address in Networking? T...

What is MAC address in Networking? The address for a device as it is recognized at the Media Access Control (MAC) layer in the network architecture. MAC address is usually kept

Circuit switched networks, Question 1 Write about                       Ci...

Question 1 Write about                       Circuit Switched Networks                       Packet Switched Networks Question 2 Write about                       Protocol Indep

What is bridged ethernet, Bridged Ethernet Raises bandwidth by divi...

Bridged Ethernet Raises bandwidth by dividing the network into smaller networks allowing concurrent communications Separates collision domains because traffic is lower

List all application layer and transport layer protocols, a)  A host is sen...

a)  A host is sending a HTTP request to a HTTP server. In the table below, propose a correct set of source and destination port numbers for segments sent from host to server and fr

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