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

., 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

Authentication mechanism in vpn, What are the dissimilar ways authenticatio...

What are the dissimilar ways authentication mechanism in VPN?

What are the drawbacks of arcnet, What are the drawbacks of ARCNet? Her...

What are the drawbacks of ARCNet? Here are some drawbacks of ARCNet: 1.  Standard ARCNet is very slow (2.5 Mb/s). It is almost seven times slower than Token Ring. 2.  ARC

What is remote procedure call, What is Remote Procedure Call (RPC)? RPC...

What is Remote Procedure Call (RPC)? RPC hides the intricacies of the network by using the ordinary process call mechanism familiar to every programmer. A client process calls

Describe random forests, Random forests : An ensemble of the classification...

Random forests : An ensemble of the classification or the regression trees (see the classification and regression tree methods) that have been fitted to the same n observations, bu

Round trip time and time out - transport layer, Round Trip Time (RTT) and T...

Round Trip Time (RTT) and Time Out The  size and  the complexity  of computer  networks  have grown  in past years. To achieve  an efficient  and reliable transmission  some

Explain network services, Explain Network Services Network services are...

Explain Network Services Network services are the thing that a network can do. The main networking services are File Services: This contains file transfer, storage, data m

Show the communication between switches in VLAN, Q. Show the Communication ...

Q. Show the Communication between Switches? Communication between Switches - Must know which station belongs to which VLAN as well as membership of stations connected to

State 802.11 DSSS , 802.11 DSSS a) Direct sequence spread spectrum in a...

802.11 DSSS a) Direct sequence spread spectrum in a 2.4 GHz band b) Each bit is replaced by a sequence of bits called a chip code, implemented at the physical layer c) Se

Determine teh term - selection of computing infrastructure, Selection of co...

Selection of computing infrastructure The computing equipment on an Intranet must be selected in such a manner that they do not get obsolete very quickly or become too costly f

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