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

Floating point representation in memory, Floating Point Representation in M...

Floating Point Representation in Memory 1. Describe the various ways of floating point representation in memory. What is the importance of normalizing the mantissa in this rep

Illustrate user agent services, Q. Illustrate User Agent Services? Use...

Q. Illustrate User Agent Services? User Agent (UA) Services - Provide template for user to compose a message - Reads incoming messages - Allows a user to reply to m

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

Programming with pvm, The Common method for writing a program with PVM is a...

The Common method for writing a program with PVM is as follows: A user writes one or more sequential programs in C, C++, or Fortran 77 having embedded PVM function (or subroutin

Describe the tcp/ip reference model, Computer Networks 1. Differentiate...

Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu

Show the parity check - performance, Q. Show the Parity Check - Performance...

Q. Show the Parity Check - Performance? Parity Check - Performance Is able to detect all single-bit errors Can as well detect burst errors if the total number of

Computer nework critira, what is compurter network and types, topology, com...

what is compurter network and types, topology, communication media

Give some examples of the session layer, Session layer examples are Netbios...

Session layer examples are Netbios Names, SQL, NFS, X Windows, and RPC

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