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

Permutation representation through matrix, Q. Permutation representation th...

Q. Permutation representation through Matrix? Figure: Clos Network The functioning of this above permutation is displayed in Figure. This permutation is able to

Determine 10base5 - thicknet, 10Base5 - Thicknet A rigid coaxial c...

10Base5 - Thicknet A rigid coaxial cable (RG-8) approx 0.4 in' thick used in the original Ethernet networks Bus topology LAN utilize base signalling with a maximum se

Explain how a cdma system works, (a) Explain how a CDMA system works? (b...

(a) Explain how a CDMA system works? (b) Explain howWelsh-Hadamard codes are generated. Explain why orthogonality between different spreading codes is important. (c) Consider

Show scalability and reliability of computer network, How do you account fo...

How do you account for higher scalability and reliability of computer network? Ans: Computer network will have a large number of computers, which can share database, software

Explain pipeline processing, Pipeline Processing Pipelining is a scheme...

Pipeline Processing Pipelining is a scheme to realize, overlapped parallelism in the proposed way out of a problem on a digital computer in an economical way. To understand the

Database management, today, what is the most common or mostly encountered p...

today, what is the most common or mostly encountered problem in terms of database management system?

What is oltp, In the transaction server, the client component usually consi...

In the transaction server, the client component usually consists of GUI and the server components usually having of SQL transactions against a database. These applications are know

How to install an anti-virus program, In a network that contains two server...

In a network that contains two servers and twenty workstations, where is the best place to install an Anti-virus program? An anti-virus program must be installed on all servers

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