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

Difference among flow control and error control, What is the difference am...

What is the difference among  flow control and error control?    Ans) Flow control: adjust and confirm data flow rate for successful transmission. Error Control: a method to

Find the main problems with access points in a wireless lan, Question: ...

Question: Wireless Access points have been known to have various security vulnerabilities that can lead to breach of Secured wired networks. IEEE 802.11 standards have identifi

What is remote procedure call, What is Remote Procedure Call (RPC)? RPC...

What is Remote Procedure Call (RPC)? RPC hides the intricacies of the network by using the ordinary process call mechanism familiar to every programmer. A client process calls

Discuss on the characteristics of agents, Question 1 Discuss on the cha...

Question 1 Discuss on the characteristics of agents 2 Belief, Desire and Intention architecture is the most popular agent architecture. Procedural Reasoning System (PRS) is

Describe peer-to-peer networking, You are requested to design a secure home...

You are requested to design a secure home or small scale network (Fig. 1) to satisfy the key concepts underlying computer and network security: confidentiality, integrity, availabi

Error control in TCP, Q. Show the Error control in TCP? Error control ...

Q. Show the Error control in TCP? Error control in TCP Detect lost segments, out-of-order segments, corrupted segments and duplicated segments Three tools: chec

Bit stuffing, bit stuffing program in python

bit stuffing program in python

What is oltp, What is OLTP? In the transaction server, the client compo...

What is OLTP? In the transaction server, the client component usually contains GUI and the server components usually having of SQL transactions against a database. These applic

Explain fully connected interconnection networks, Fully connected : It is t...

Fully connected : It is the most powerful interconnection topology.  In this every node is directly associated to all other nodes. The limitation of this network is that it needs t

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