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

How l2f establishes the tunnel, Can you describe the broader steps of how L...

Can you describe the broader steps of how L2F establishes the tunnel?

describe the mips instructions - computer architecture, 1.  Detail for eac...

1.  Detail for each of the four following MIPS instructions, which actions are being taken at each of their five steps.  Do not forget to mention how and during which steps each in

Error detection-- crc, Error Detection-- CRC Powerful error detecti...

Error Detection-- CRC Powerful error detection system Rather than addition, binary division is utilized A series of redundant bits called "CRC" or else "CRC remai

Briefly write functionalities of different osi layers, Briefly write functi...

Briefly write functionalities of different OSI layers? The OSI Reference Model includes seven layers. Basic functionality of each of them is as follows: 1. Physical Layer:

Calculate the efficiency of stop-and-wait ARQ, Suppose that frames are 1250...

Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. Calculate the efficiency of stop-and-wait ARQ (a) Transmits a

Unshielded twisted pair - transmission media, Q. Unshielded Twisted Pair - ...

Q. Unshielded Twisted Pair - transmission media? - A most common kind suitable for both voice and data transmission - Categories are determined by chain quality - Cat 3 c

Internet mail access protocol - application layer, Internet  Mail Access P...

Internet  Mail Access Protocol Another  mail access  protocols  is internet  mail access  protocols  version 4 (  IMAP4). IMAP4 is  similar to POP3 but it  has more  feature

What are the drawbacks of ethernet cabling, What are the drawbacks of Ether...

What are the drawbacks of Ethernet Cabling? The Ethernet cabling ahs the following drawbacks: 1. Ethernet is not a high-level performer in high-load environments. This proto

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