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

Reliability - fundamentals of networks , Reliability Reliability  is t...

Reliability Reliability  is the measure of how  often  a network is usable. MTSF( Mean time  Between Failure) is a measure of the average time  a component  is expected to ope

Physical media - computer network, Physical Media In order  to define ...

Physical Media In order  to define what is meant by a physical medium let us reflect on the brief life of a bit. Consider  a bit travelling from one end system through a serie

Source to destination data transfer - datagram approach, Source to Destinat...

Source to Destination Data Transfer - Datagram approach - Each packet is treated independently. - Every pkt will take its own path to reach the destination. - There i

Network layer - computer network, Network Layer The  internet  network...

Network Layer The  internet  network  layer is  responsible  for moving  network  layer  packets  known data grams  from one host to another. The internet transport  layer pro

Distribution system from bss, To Distribution System from BSS We requir...

To Distribution System from BSS We require to identify the AP as the first hop to the destination (B) A will receive an ACK from the AP - indicates frame successfully on

Repeater - network layer and routing, Repeater Repeater is  also named...

Repeater Repeater is  also named as active hub operates at physical  layer of OSI model. Repeater is an  electronic  device that simply regenerates the signal. Signals travell

Determine about the infrared spectrum, Determine about the infrared spectru...

Determine about the infrared spectrum (1) The spectrum for infrared is virtually unlimited, which shows the possibility of achieving extremely high data rates. (2) The infra

Methods of reliability prediction, I NTRODUCTION Reliability  predicti...

I NTRODUCTION Reliability  prediction  is  an  important  method  for  evaluating  a  system design, right from its conceptual stage through development and manufacture and al

Parallel virtual machine (pvm), PVM (Parallel Virtual Machine) is a portabl...

PVM (Parallel Virtual Machine) is a portable message-passing programming system, designed to link divide heterogeneous host machines to form a "virtual machine" which is a one, man

Explain the changes to the ip stack, After powering up his PC, Bob notices ...

After powering up his PC, Bob notices the PC was not able to properly connect to network devices. He obtained the following information from his workstation: C:\>ipconfig Win

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