Running the simulator on a fat tree with k=48 (~3000 nodes, ~60,000 edges) was taking obscenely long so I've the made the following changes to speed up the program:

-Commented out aggregation of bitvectors in each switch
-Commented out token buckets
-Removed freeing memory belonging to entities at the end of the simulation with the understanding that the os will do it anyway
-Avoided scheduling events that have dispatch times past the end of the simulation
-Fixed bug in LOG_HANDLE macro that was calling var->Description() regardless of logging level

Will implement more efficient versions of token buckets (which might be altogether unnecessary) and bitvector aggregation.