Skip to main content
Open Access Publications from the University of California

On the stability of a batch clearing system with poisson arrivals and subadditive service times

  • Author(s): Aldous, D
  • Miyazawa, M
  • Rolski, T
  • et al.

We study a service system in which, in each service period, the server performs the current set B of tasks as a batch, taking time s(B), where the function s(·) is subadditive. A natural definition of 'traffic intensity under congestion' in this setting is ρ := limt → ∞ t-1Es (all tasks arriving during time [0, t]). We show that ρ < 1 and a finite mean of individual service times are necessary and sufficient to imply stability of the system. A key observation is that the numbers of arrivals during successive service periods form a Markov chain {An}, enabling us to apply classical regenerative techniques and to express the stationary distribution of the process in terms of the stationary distribution of {An}.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
Current View