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

Process of securing an intranet, Process of Securing an Intranet Secur...

Process of Securing an Intranet Securing an Intranet is not a simple task. Mere installation of firewall hardware and software would not help the Intranet to protect itself. P

One characteristic of rarp?, Reverse Address Resolution Protocol is used to...

Reverse Address Resolution Protocol is used to get a layer 3 address if the MAC address is called which then facilitates the loading of the O/S.

Ipx traffic on a network, To monitor ipx traffic on a network, what command...

To monitor ipx traffic on a network, what command would we use? Ans) show ipx traffic

Distributed route computation, In distributed routing computation, every pa...

In distributed routing computation, every packet switch calculates its routing table locally and transmit messages to the neighbors. It also updates information regularly. If a pac

IP datagram, On a LAN where are IP Datagram transported?

On a LAN where are IP Datagram transported?

System deadlock in shared programme structures, System Deadlock A dead...

System Deadlock A deadlock refers to the situation when simultaneous processes are holding resources and preventing each other from completing their implementation. The fol

What is meant by 3-tier architecture, In 3-tier Client/Server systems, the ...

In 3-tier Client/Server systems, the application logic (or process) lives in the middle tier and it is removed from the data and the user interface. In theory, the 3-tier Client/Se

Explain the different signal propagation behaviours, Question : (a) Lis...

Question : (a) List down and explain the different signal propagation behaviours that radio waves exhibit. (b) Explain the term Delay Spread with reference to signal propaga

Repeaters, REPEATERS:  Repeaters are needed when copper wire communica...

REPEATERS:  Repeaters are needed when copper wire communication is takes place. According to the fact that electrical signal goes weaker while travelling over copper lines. A

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