
31
2
Computer Networks
with Finite Buffers
Beyond Jackson’s Theorem
Lev B. Levitin and Yelena Rykalova
ABSTRACT
We present theoretical models and simulation results for performance of a multiprocessor network
modeled as a ring and as a 2D wraparound square lattice of nodes with local processors that gener-
ate messages with constant rate per time slot. The buffers can hold a limited number of messages.
Explicit theoretical results based on rst-order (independent queues) and second-order approxima-
tion of the queue distributions are obtained for small buffer sizes (1 and 2). For larger buffers, the
problem appears analytically intractable and has be ...