MPS-RR 1999-28
September 1999

Heavy Traffic Limits for Some Queueing Networks

Maury Bramson, J. G. Dai

Abstract

Using a slight modication of the framework in Bramson [7] and Williams [52], we prove heavy traffic limit theorems for six families of multiclass queueing networks. The first three families are single station systems operating under first-in first-out (FIFO), generalized head- of-the-line proportional processor sharing (GHLPPS) and static buffer priority (SBP) service disciplines. The next two families are re-entrant lines operating under first-buffer-first-serve (FBFS) and last-buffer-first-serve (LBFS) service disciplines; the last family consists of certain 2-station, 5-class networks operating under an SBP service discipline. Some of these heavy traffic limits have appeared earlier in the literature; our new proofs demonstrate the signicant simplications that can be achieved in the present setting.

Availability: [ gzipped ps-file ] [ pdf-file ]

[ Help on down-loading/viewing/printing ]