The spatial requirement of an M/G/1 queue, or: How to design for buffer space

  • Bhaskar Sengupta
Models Of Storage Processes
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 60)


Consider an M/G/1 queue where each customer (independently of others) has a space requirement which may depend on its service time. We find the steady state distribution of the total space required by all customers present in the system. An application of the model is in the field of message switching where the memory space required by a message is (usually) a monotonic function of the service time. By using the processor sharing version of the M/G/1 queue, another application may be in the design of storage space required for time sharing computers.


Service Time Priority Queue Steady State Distribution Processor Sharing Buffer Occupancy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Kosten, "Stochastic Theory of Service Systems," Pergamon Press, 1973.Google Scholar
  2. [2]
    M. Sakata, S. Noguchi, J. Oizumi, "Analysis of a Processor Shared Queuing Model for Time Sharing Systems," Proceedings of the Second Hawaii International Conference on Systems Sciences, 625–528, January, 1969.Google Scholar

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Bhaskar Sengupta
    • 1
  1. 1.Bell Laboratories (HO4M303)HolmdelU.S.A.

Personalised recommendations