On queues involving batches

S. G. Mohanty

30 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Probability and Risk Models

Abstract

It has been demonstrated by Takács in a series of papers and in his book that combinatorial methods can be successfully applied to derive certain probability distributions in queueing processes. In this paper, we further illustrate the usefulness of combinatorial techniques and determine the stochastic law of the busy period in two queueing systems particularly involving batches. It may be of interest to note that queues involving batches have been dealt with in [3] and [7].

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 30 citations exist upstream.

Cited by

1993Lattice path approach to transient solution of M/M/1 with (0,k) control policy 1975On Bivariate Power Series Distributions Associated with Lagrange Expansion 1994Transient analysis of queues with heterogeneous arrivals 2006Lattice path approach for busy period density of M/G/1 queues using C3 Coxian distribution

Imported from OpenAlex (CC0) — nothing here is generated.