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 the data units at dissimilar layers of the tcp / ip, What are the ...

What are the data units at dissimilar layers of the TCP / IP protocol suite? The data unit formed at the application layer is called a message, at the transport layer the data

Assignment, i want to make the assignment from you

i want to make the assignment from you

Name the factors that affect the performance of the network, Name the facto...

Name the factors that affect the performance of the network? a. Number of Users b. Type of transmission medium c. Hardware d. Software

Enumerate about the traffic policing, Enumerate about the Traffic policing ...

Enumerate about the Traffic policing Traffic policing happens when a flow of data is regulated so that cells (or frames or packets) that exceed a performance level are discarde

., Given a five station token bus LAN with station addresses of 3000, 500, ...

Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assum

Causes of failures, CAUSES OF FAILURES Every failure has a well-define...

CAUSES OF FAILURES Every failure has a well-defined cause.  Any system or device has an inherent strength or capacity to resist failures. This depends on design, material, man

What are the ethernet frame fields, Ethernet Frame Fields Preamble ...

Ethernet Frame Fields Preamble - seven bytes of alternating 0s also 1s to notify receiver of incoming frame and to provide synchronization SFD (Start frame delimiter)

Advantages, What are advantages of having e-commerce over extranets

What are advantages of having e-commerce over extranets

Configure spanning tree- ccna, Configure Spanning Tree Step 1: Ex...

Configure Spanning Tree Step 1: Examine the default configuration of 802.1D STP. On each switch, display the spanning tree table with the show spanning-tree command. R

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