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 authentication, Q. What is Authentication ? - Verification of s...

Q. What is Authentication ? - Verification of sender's identity. - Accomplished through a digital signature, which is based on public key encryption/decryption. - Uses re

Layered architecture - computer network, Layered Architecture The best...

Layered Architecture The best  way to  understand  any complex system is to break  it into  pieces  and then analyze what they  do and  how they interact. The most logical app

Illustrate nonboundary-level masking with example, Q. Illustrate Nonboundar...

Q. Illustrate Nonboundary-Level Masking with example? Nonboundary-Level Masking Example IP address 45 123 21 8 Mask 255 192 0 0 Subnet 45 64 0 0 123 0

Hardware difficulty, Hardware difficulty It refers to the price of hard...

Hardware difficulty It refers to the price of hardware logic like connectors, wires, switches, arbiter etc. that are required for execution of interconnection network.

Show coaxial cable connectors, Q. Show Coaxial Cable Connectors? - A mo...

Q. Show Coaxial Cable Connectors? - A most common is barrel connector (BNC) - T-connectors are utilized to branch off to secondary cables - Terminators are necessary for

Signaling, The term signaling is used to define communication about the net...

The term signaling is used to define communication about the network, as opposed to interaction that just uses the network. A computer uses signaling with reserved VCI/VPI numbe

Describe mail access protocols, Q. Describe Mail Access Protocols? Mai...

Q. Describe Mail Access Protocols? Mail Access Protocols - Used by receiver to retrieve mail when desired - Post Office Protocol, version 3 (POP3) is a simple limited

Explain full duplex data transmission, Q. Explain Full Duplex data transmis...

Q. Explain Full Duplex data transmission? - Have two separate Communication channels as well as use each one for simplex Data traffic (in different directions). - If this is

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