Stability and performance of distributed simulators for open queueing networks

We study the performance of distributed simulation of open queueing networks, by analysing queueing models of message flows in distributed discrete event simulators. We view each logical process in a distributed simulation as comprising a message sequencer with associated message queues, followed by an event processor. We show that, with standard stochastic assumptions for message arrival and time stamp processes, the message queues are unstable for conservative sequencing, and for conservative sequencing with maximum lookahead and hence for optimistic resequencing, and for any resequencing algorithm that does not employ interprocessor “flow control�?. This result immediately yields throughput bounds for distributed simulation of feedforward queueing networks. We also present throughput bounds and simulation results for the distributed simulation of a simple open queueing network with feedback