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

Point to point architecture - application layer, Point to Point Architectur...

Point to Point Architecture The term  peer means equal which can  be informally  interpreted as a process with  capability similar to the other processes with process communic

Dns tunneling – domain name server, DNS Tunneling – Domain Name Server ...

DNS Tunneling – Domain Name Server "If, on one system, it is possible to transmit bits to another in any form, and in turn receive a reply as a result of that transmission, th

What are the advantages of the intranet, What are the Advantages of the int...

What are the Advantages of the intranet The most easily noticeable difference between an Internet server and an Intranet server such as Lotus Notes is their design philosophy.

Light sources and connectors, - Light source is LED (light-emitting diode) ...

- Light source is LED (light-emitting diode) or a laser - LEDs are cheaper however not as precise (unfocused) limited to short-distance use - Lasers is able to have a narrow

What is source routing, Q. What is Source Routing? Source Routing ...

Q. What is Source Routing? Source Routing - Sender of packet defines bridges and routes that packet should take - Complete path of bridge IDs and destination address i

Describe full-duplex transmission, Full Duplex - Capability for simultaneou...

Full Duplex - Capability for simultaneous data transmission among a sending station and a receiving station. It needs a workstation be attached to a switch, the NIC must support it

Spanning tree protocol - ccna, Perform Basic Switch Configurations Step...

Perform Basic Switch Configurations Step 1: Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has

Program annotation packages, A fairly renowned approach in this area is Ope...

A fairly renowned approach in this area is OpenMP, a recently developed industry standard for shared memory programming on architectures with uniform memory access characteristics.

Parallel balance point, Parallel Balance Point In order to implement a ...

Parallel Balance Point In order to implement a parallel algorithm on a parallel computer, K number of processors is needed. It may be noted that the given input is assigned to

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