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 difference among arp and rarp, What is difference among ARP and RAR...

What is difference among ARP and RARP? The address resolution protocol (ARP) is used to associate the 32 bit IP address with the 48 bit physical address, used by a host or a ro

What is the role of ieee in computer networking, What is the role of IEEE i...

What is the role of IEEE in computer networking? IEEE, or the Institute of Electrical and Electronics Engineers, is an organization composed of engineers that issues and manage

Describe the rpc and client server architecture, Can you describe the RPC a...

Can you describe the RPC and Client server Architecture?

What is wdm, What is WDM? WDM is conceptually the similar as FDM, excep...

What is WDM? WDM is conceptually the similar as FDM, except that the multiplexing and demultiplexing includes light signals transmitted by fiber optics channel.

Iso - organization for standardization, - The ISO (International Organisati...

- The ISO (International Organisation for Standardisation) is an International standards organisation responsible for a wide range of standards including many that are relevant to

Coaxial Cable - computer network, Coaxial Cable Coaxial  cable  carrie...

Coaxial Cable Coaxial  cable  carries signals  of higher  frequency ranges than those in twisted pair cable. In part  because the two media are constructed quite  differently.

Digital encoding scheme, what are the applications of different encoding sc...

what are the applications of different encoding schemes

Explain the public-key cryptography, Q. Explain the Public-Key Cryptography...

Q. Explain the Public-Key Cryptography? Public-Key Cryptography - Each user has the same encryption algorithm and key - Decryption algorithm also key are kept secret

Selective repeat ARQ, Selective Repeat ARQ - Processing at the receive...

Selective Repeat ARQ - Processing at the receiver additionally complex - The window size is reduced to 2(m-1) (2m/2 at most) - Both the transmitter as well as the receiv

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