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 is project 802, What is Project 802? It is a project begins by IEE...

What is Project 802? It is a project begins by IEEE to set standards that enable intercommunication among equipment from a variety of manufacturers. It is a way for specifying

Cnet sliding window protocol, implementing cnet sliding window protocol wit...

implementing cnet sliding window protocol with 6 nodes

What is multiplexing, What is Multiplexing? Multiplexing is the set of ...

What is Multiplexing? Multiplexing is the set of techniques that permits the simultaneous transmission of multiple signals across a single data link.

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 are routers, What are routers? Routers work to connect two or more...

What are routers? Routers work to connect two or more network segments. These are the most intelligent network devices that store information in its routing table like paths, h

What are diagrams and trigrams, What are Diagrams and Trigrams? The mos...

What are Diagrams and Trigrams? The most ordinary two letter combinations are known as diagrams. e.g. th, in, er, re and an. The most common three letter combinations are known

What is uniform delivery time, What is uniform delivery time A uniform ...

What is uniform delivery time A uniform delivery time is required for voice, so amount of jitter in net- work is significant. This could be expressed as standard deviation of d

DHCP, Describe DHCP concept

Describe DHCP concept

Illustrate network layer in osi layers model, Q. Illustrate Network Layer i...

Q. Illustrate Network Layer in osi layers model? Network Layer :  This is responsible for addressing messages and data so they are sent to the required destination, and for tr

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