Current Algorithm

• Simulated annealing

  • Make random change (move node from one switch to another), compute score, accept/reject based on current temp.

• Heuristic algorithm

• ~ 4 seconds for 30 nodes; polynomial

• Improve:

  • Hardwired node connections will slow it down x100
  • Edge nodes
  • Speed - incremental score recomputation

Previous slide

Next slide

Back to first slide

View graphic version