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

Encoding data options in parallel virtual machine , Encoding data options ...

Encoding data options PVM uses SUN's XDR library to generate a machine independent data format if you request it. Settings for the encoding option are: PvmDataDefault: Use X

Question, On a lan where are ip datagram transported?

On a lan where are ip datagram transported?

What can be done to fix signal attenuation problems, What can be done to fi...

What can be done to fix signal attenuation problems? A common way of dealing with like problem is to use repeaters and hub, because it will help regenerate the signal and thus

One characteristic of rarp?, Reverse Address Resolution Protocol is used to...

Reverse Address Resolution Protocol is used to get a layer 3 address if the MAC address is called which then facilitates the loading of the O/S.

Distant vector protocols, RIP and IGRP are Distance Vectoring protocols tha...

RIP and IGRP are Distance Vectoring protocols that send their whole routing tables to their neighbours. In some Cisco literature, EIGRP is listed as an 'advanced distance vector

Fault tree analysis, FAULT TREE ANALYSIS Reliability engineering, in a ...

FAULT TREE ANALYSIS Reliability engineering, in a nutshell is concerned with failures.   How failures occur, how often they occur, and how to minimize them are the basic proble

E-NRZ, A modified NRZ code known as enhanced-NRZ (E-NRZ) operates on 7-bit ...

A modified NRZ code known as enhanced-NRZ (E-NRZ) operates on 7-bit words; inverting bits 2,3,6 and 7; and adding one parity bit to each word. The parity bit is chosen to make the

Tcp-ip and osi differences, Q. TCP-IP and OSI Differences - TCP/IP com...

Q. TCP-IP and OSI Differences - TCP/IP combines the Presentation and Application Layers - TCP/IP combines the OSI Data Link and Physical Layers into 1 Layer - TCP/IP app

Retransmission of packets - transport layer, Retransmission of packets ...

Retransmission of packets The disadvantage  of thronging away a correctly received packet is that  the subsequent retransmission  of the  packet might  be lost  or garbled and

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