2

I am trying to deploy Dijkstra's Algorithm for finding the shortest path between switches in a balanced fat-tree topology. The problem is that I do not know what values/unit of weight should be in order to build routing tables for each switch (e.g., link BW capacity, counting the number of switches to a destination, etc.). The issue is that all links have the same bandwidth and the number of switches is identical to transfer packets from host A to host B, refer to the attached figure.

Regards,

enter image description here

6
  • Is this a homework assignment? "Deploying an algorithm" does not make much sense, you deploy an implementation of an algorithm.
    – Teun Vink
    Mar 7, 2018 at 10:56
  • It is not a homework. Yes, I would like to deploy its implementation.
    – KaySay2018
    Mar 7, 2018 at 11:01
  • 1
    which implementation?
    – Teun Vink
    Mar 7, 2018 at 11:02
  • It is already written, Dijkstra's Algorithm!
    – KaySay2018
    Mar 7, 2018 at 11:06
  • 1
    An algorithm describes how you solve a problem. An implementation is the translation of an algorithm to code which can run on a device. You can't deploy an algorithm. Dijkstra's shortest path algorithm is used in various routing protocols, but you can't "deploy Dijkstra's algorithm".
    – Teun Vink
    Mar 7, 2018 at 12:16

1 Answer 1

2

Dijkstra's Algorithm doesn't define what the weight should be. The weight value lets you decide which links are preferred. If, as you say, all the links have the same bandwidth, then perhaps you don't have a preference. All weights should be the same.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.