Skip to Main Content
This Communication considers a queueing problem that arises in the design and evaluation of circulating types of computer storage devices, such as magnetic drums. This many-line, many-server queueing problem is treated using approximate methods, and the distribution is determined for the number of items waiting in one of the lines.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.