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

Prepare the network of spanning tree protocol -ccna, Prepare the Network  ...

Prepare the Network  Step 1: Disable all ports by using the shutdown command. Ensure that the initial switch port states are inactive with the shutdown command. Use the inter

What does jade stands for, QUESTION (a) Briefly describe the dire...

QUESTION (a) Briefly describe the direct coordination model and the meeting oriented coordination model (b) What does JADE stands for? (c) Name the three spec

Factors effects the quality of image of monitor, Q. Factors effects the qua...

Q. Factors effects the quality of image of monitor? Four factors effects the quality of image of monitor:   1.  Phosphor coating: This affects the colour and persistence (Th

Describe the method of one way redistribution and mutual, Define  the conce...

Define  the concept of one way redistribution and mutual

Relationship between throughput and delay, If a data packet switch has a qu...

If a data packet switch has a queue of data packets waiting when a new packet reach. The new packet will be located on the whole queue and will have to wait while the switch forwar

Command to copy the ios image to a tftp server, What is the command to copy...

What is the command to copy the IOS image to a TFTP server? Ans) Copy flash tftp

What is topology, Q. What is Topology? - Physical/logical arrangement ...

Q. What is Topology? - Physical/logical arrangement - Topology of a network is the geometric depiction of the relationship of all the links and linking devices to one anothe

What is difference between arp and rarp, What is difference between ARP and...

What is difference between ARP and RARP? The address resolution protocol (ARP) is used to associate the 32 bit IP address with the 48 bit physical address, used by a host or a

Protocol gets a hardware address from a known ip address, Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

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