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

Protocols are used for logical network addressing, Which of the following p...

Which of the following protocols are used for logical network addressing? Ans) Internet Protocol - IP gives routing and a one interface to the upper layers. No upper layer proto

How is final different from finally and finalize, How is final different fr...

How is final different from finally and finalize ()? Final is a modifier which can be applied to a class or a method or a variable. final class can't be inherited, final method

Link-state routing, In link-state routing network topology is filled from...

In link-state routing network topology is filled from route calculation. Switches send link-state information about local joins. Every switch creates own routing tables. It needs

Sketch the output waveform square wave that symmetrical, Question: The ...

Question: The input to the circuit in the figure is a square wave that is symmetrical about 0V. Sketch the output waveform.

Wireless Networks, Is a complete OSI/TCPIP network architecture available i...

Is a complete OSI/TCPIP network architecture available in MATLAB?

Explain the meaning of negotiation, Explain the meaning of Negotiation ...

Explain the meaning of Negotiation Negotiation is process of getting both sides to agree on some values or parameters to be used during communication. Maximum packet size is on

What does the user datagram protocol (udp) , UDP is connectionless, and doe...

UDP is connectionless, and does not give error checking. But remember, error checking can happen at other layers too.

Point out the drawbacks of token ring, Point out the drawbacks of Token Rin...

Point out the drawbacks of Token Ring. Few of the drawbacks of Token Ring are: a. Token Ring is very costly. All topology components cost much more than other more popular s

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

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

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