Diffusion approximations and models for certain congestion problems

In a variety of the congestion or queueing problems that arise in practice, for example, in studies of the crossing and entry problems of road traffic, (see Evans, Herman, and Weiss [2]), and recently of the service afforded by large centralized and shared computer facilities, (see Scherr [12]), the understanding of system performance furnished by the present mathematical theory is inadequate. The reason is that while the consideration of simple problems typically yields elegant mathematical results, the form of these results—often expressed in terms of integral transforms—is not immediately comprehensible nor useful for simple comparisons. This fact has been remarked upon by Newell, who in [9] has suggested certain more comprehensible but approximate approaches based on diffusion theory; further promising developments and elaborations will be found in [10]. The latter approach is related to the “heavy traffic theory” of J. F. C. Kingman [8], and to some recent work of Iglehart [6]. Of course, the idea of approximating complex discrete-state processes by diffusion processes with continuous paths is not new. It has long been used in genetics, see Feller [3], and the review paper by Kimura [7]. Nonetheless, applications to congestion theory are apparently still rather rare.