Heavy-traffic analysis of multi-type queueing under probabilistically load-preferential service order
By: Donald P. Gaver, J.A. Morrison
Contributors: Morrison, J. A.; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1990
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Subjects: APPROXIMATION(MATHEMATICS)
Other titles: NPS-55-90-18.
Description: A model of queueing for a single server by several types of customers (messages, or jobs),      with a simple dynamic priority rule, is considered. The rule is equivalent to selecting the next      server occupant type with a probability proportional to the number of that type enqueued.      The situation studied here occurs in fields such as computer and communication system      performance analysis, in operational analysis of logistics systems, and in the repair of      elements of a manufacturing system. It is assumed that the population sizes of the items of      different types are large, and that the mean service rates are correspondingly large, in      comparison with the service demand rates. Moreover, it is assumed that the system is in      heavy traffic. Under these assumptions, asymptotic approximations are derived for the      steady-state means and covariances of the number of items of different types either waiting      or being served. Numerical comparisons with simulated results show excellent agreement.
Notes: Cover title.

"NPS-55-90-18."

"August 1990."

AD-A230 371.

Includes bibliographical references.

aq/aq cc:9116 05/09/97