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 backbone network, What is backbone network? A backbone network ...

What is backbone network? A backbone network is a centralized infrastructure that is intended to distribute dissimilar routes and data to various networks. It also handles mana

Classification of access networks - computer network, Classification of Ac...

Classification of Access Networks Access  networks  can loosely  be classified into three  categories 1. Residential Access 2. Company Access 3. Wireless Access

Importance of implementing a fault tolerance system, What is the importance...

What is the importance of implementing a Fault Tolerance System? Are there limitations? A fault tolerance system makes sure continuous data availability. This is done by elimin

Status of the frame relay virtual circuit, Recognize the command to show th...

Recognize the command to show the status of the Frame Relay virtual circuit Ans) Router# show frame-relay pvc

Computer Networking help, Hello, I have a question which is due tomorrow (2...

Hello, I have a question which is due tomorrow (2/15/2013) at 11:55pm. The configuration portion of the exercise has been completed. I only need the questions in bold answered (onl

Additional bandwidth does each scheme require, Recalling two FEC schemes fo...

Recalling two FEC schemes for internet phone described. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-ra

Show ethernet media standard, Q. Show Ethernet Media standard? - The ca...

Q. Show Ethernet Media standard? - The cables and connector specifications utilized to support Ethernet implementations are derived from the EIA/TIA (Electronic Industries Asso

Diffuse reflection in the basic illumination model, Question: (a) By ma...

Question: (a) By making use of an example, explain the Cohen-Sutherland line clipping algorithm. (b) Compare and contrast between the CMY and RGB colour models. (c) Expla

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