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 vrc, What is VRC? It is the most common and least costly mechan...

What is VRC? It is the most common and least costly mechanism for Error Detection. In VRC, a parity bit is added to each data unit so that the total number of 1s becomes even f

Objective of parallel algorithms, After studying this part the students wil...

After studying this part the students will be able to understand about the following: Analysis of Parallel Algorithms; Different Models of Computation; o   Interco

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

State about the bus topology, State about the Bus Topology Comments ...

State about the Bus Topology Comments 1 - Requires less cabling than a star network 2 - If there is a central cable problem entire netwo. rk goes down 3 - Less e

Define interconnection network, Interconnection Network An interconnect...

Interconnection Network An interconnection network is designed for transferring data between two processors in a Multi-stage network. Memory bottleneck is a fundamental limitat

Application to exploring network packet capture, This lab introduces basic ...

This lab introduces basic network capture concepts using Wireshark. Setup You will need a PC running Windows for this lab and you will need to install the Wireshark softwar

Explain semantic web , What the Semantic Web is? Ans) The Semantic Web ...

What the Semantic Web is? Ans) The Semantic Web is a vision, that thinks to join together dispersed bits of data on the internet, very much like web pages are presently joined

Define the term - handoff and dynamic configuration, Define the term - Hand...

Define the term - Handoff and Dynamic configuration Handoff/roaming  The MAC protocol used in the wireless LAN should enable mobile stations to move from one cell to anoth

Protocol layers and their service models - computer network, Protocol Laye...

Protocol Layers and their Service Models The  internet is an extremely complicated system. It  consists of many  pieces like  numerous  applications and protocols  various  t

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