Critical phenomena in discrete-time interconnection networks

Abstract

We present theoretical and numerical results for the performance of a multiprocessor network modeled as a ring and as a toroidal square lattice of nodes with local processors that generate messages for output ports/buffers. The output buffers are assumed to have infinite capacity, and the service time is deterministic. Two models are considered. One assumes that every processor generates messages with rate λ per time slot and per output port/buffer. The other model considers that the generation rate of a node depends on the intensity of the flow of arriving messages. Explicit expressions for the distribution of queue lengths, the average number of messages in the buffers, the average latency, and the critical network load depending on the distance between the source and the destination are obtained. Simulation results show excellent agreement with theoretical predictions based on the assumption of independent queues.