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

Describe essential security services, Problem: (a) Application Layer pr...

Problem: (a) Application Layer protocols can be classified as connection-oriented or connectionless-oriented. i. What do you understand by the term protocol? ii. Give an e

Roles of host system, Q.Role of Host System? Hosts on OSI implementatio...

Q.Role of Host System? Hosts on OSI implementations don't handle network operations (simple terminal) but TCP/IP hosts participate in most network protocols. TCP/IP hosts do su

What is the internal ip address, What is the internal IP address There ...

What is the internal IP address There is a separate set of IP address for a company's internal use, more popularly known as "internal IP address" or subnet IP address. This IP

Tcp, how tcp is redefined for wireless network

how tcp is redefined for wireless network

Calculate the total latency, a) Consider that a host is sending a frame of ...

a) Consider that a host is sending a frame of 1200 bytes to another host found 20 Kilometers away. (Assume that switching delay is negligible) i) Calculate the total latency (

Example of record route ip option, 1. Suppose the datagram source allocates...

1. Suppose the datagram source allocates 12 bytes for this option. Then when the datagram leaves the source host, the RR option area will be like this: 7 12 4 0 0 0 0 0 0 0 0 0

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

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

Division of the address space, The IP class procedure does not split the 32...

The IP class procedure does not split the 32-bit address space into same size class and the classes do not have the same value of networks. A prefix of n bits gives 2n unique ne

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