DEVS methodology for evaluating time-constrained message routing policies (Q686329)

The paper describes the application of a general-purpose formalism for system specification to the simulation of three routing policies in a hypercube system. Half of the paper deals with the implementation of the DEVS ++ method in \(C++\) and the other half with the comparison of the efficiency of the routing techniques: Minimum-Deadline First (MDF), Minimum Laxity First (MLF) and FIFO. Results on a 6-dimensional hypercube indicate that MDF is significantly better than the other two but that it is not possible to make a significant distinction between MLF and FIFO. The authors also find that a so-called adaptive routing technique, also known as hop-by-hop, is generally better than end-to-end method where all messages are sent on the same path. They investigate single-versus multiple-copy routing and find that single-copy techniques are better on the case tested here.