Diffusion limits of limited processor sharing queues (Q535214)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5886816
Language Label Description Also known as
default for all languages
No label defined
    English
    Diffusion limits of limited processor sharing queues
    scientific article; zbMATH DE number 5886816

      Statements

      Diffusion limits of limited processor sharing queues (English)
      0 references
      0 references
      0 references
      0 references
      11 May 2011
      0 references
      The paper provides a diffusion approximation for a limited processor sharing single-server queue with infinite buffer. It is assumed that the server can serve simultaneously no more than \(K\) jobs. The rate of the service of each job is the reciprocal to the number of jobs being served. An arriving job immediately joins the server and starts to receive its service if at the moment of its arrival there are less than \(K\) jobs in the server. As soon as service of a job is finished, the job leaves the system. When, after a service completion in the server, the number of jobs there becomes equal to \(K-1\), the server selects the longest waiting job from the buffer, if any. Interarrival times are assumed to be generally distributed, and processing times are independent of each other and identically distributed. The main result of the paper is a theorem on the diffusion scaled limit to a reflected Brownian motion with specified drift, variance and initial value.
      0 references
      limited processor-sharing
      0 references
      heavy traffic
      0 references
      diffusion approximation
      0 references
      state-space collapse
      0 references
      measure-valued process
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references