Brownian models of multiclass queueing networks: Current status and open problems

This paper is concerned with Brownian system models that arise as heavy traffic approximations for open queueing networks. The focus is on model formulation, and more specifically, on the formulation of Brownian models for networks with complex routing. The current state of knowledge in this dynamic area of research, including important open problems is surveyed. Brownian approximations culminate in estimates of complete distributions; the authors present numerical examples for which complete sojourn time distributions are estimated, and those estimates are compared against simulation.