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 called transactions, The grouped SQL statements are known as Trans...

The grouped SQL statements are known as Transactions (or) A transaction is a collection of actions embused with ACID properties.

virtual private network - virtual private network vpns, Virtual private ne...

Virtual private network The virtual  private  networks takes the  user data  encrypts them and sends them  to their  destination over  the internet. the sender  and the receiv

Explain about star topology, Explain about star topology This topology,...

Explain about star topology This topology, obviously, needs a great deal of cabling. This design gives an excellent platform for reconfiguration and trouble-shooting. Changes t

Error control in TCP, Q. Show the Error control in TCP? Error control ...

Q. Show the Error control in TCP? Error control in TCP Detect lost segments, out-of-order segments, corrupted segments and duplicated segments Three tools: chec

Identify three udp characteristics, UPD is a layer 4 Transport protocol. It...

UPD is a layer 4 Transport protocol. It is connection-less due to it does establish a connection thus the 3 step handshake is not needed, it does NOT execute any flow control or ac

Network infrastructure design for a banking corporation, this is Our final ...

this is Our final year project where we have to create a network infrastructure design for a banking corporation for their new setup in Australia.for this we have to create network

Reference models - fundamentals of networks, Reference models Design...

Reference models Designing  implementing and  manufacturing  computer  networks  and related  devices  are very  complex  activities. Therefore in order  for this  technolog

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

What are the dissimilar ways authentication mechanism in VPN?

Connectionless service, In connectionless schema, there is no connection re...

In connectionless schema, there is no connection required. The source of data includes destination information in data and transmit to the network. Network transmit each data item

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