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

State the types of performance of computer hardware, State the types of per...

State the types of performance of computer hardware The hardware, i.e., the server or computer has a direct relationship on performance in the following areas: Reliabili

What are the features of star and ring topology, What are the features of s...

What are the features of star and ring topology The three networks have following features: star: best case is = 2, average case is = 2, worst case is = 2 ring: best case

Connection multiplexing, CONNECTION MULTIPLEXING:  In various circumst...

CONNECTION MULTIPLEXING:  In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran

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

What are the call routers, What are the Call routers Call routers A, B,...

What are the Call routers Call routers A, B, C, D, and E. There are ten potential lines: AB, AC, AD, AE, BC, BD, BE, CD, CE, and DE. Each of these lines has four possibilities

How do you disable advanced editing, We can deactivate advanced editing us ...

We can deactivate advanced editing us using  terminal no editing

SAN, Case study on SAN Providers and Products available in the market.

Case study on SAN Providers and Products available in the market.

Describe a typical dns system, Question: (a) With the help of a diagra...

Question: (a) With the help of a diagram, describe a typical DNS system. (b) Using signal sequence or state transition diagrams, illustrate the following scenarios: i.

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