On Discrete Time Markovian N-policy Queues involving Batches

Walter Böhm · Sri Gopal Mohanty

27 citations0/0 files storedWU Research

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 Petri Nets in System Modeling Age of Information Optimization

Abstract

Consider two Markovian N-policy queueing models in discrete time, one with batch arrival, the other with batch service. In this paper the transient behaviour of both models is studied and the analogous continuous time results are achieved by a limiting process. The steady state solution for the model with batch arrival is derived. (author's abstract)

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 — 27 citations exist upstream.

References

1963Introduction to the Theory of Queues.1983A First Course in Bulk Queues 1973The single server queue in discrete time‐numerical analysis II

Cited by

1997The combinatorics of birth-death processes and applications to queues 2007A discrete-time single-server queue with a modifiedN-policy 2010Lattice path counting and the theory of queues 2008The randomized threshold for the discrete-time Geo/G/1 queue 1997Single Server Queueing System with Poisson Input: A Review of Some Recent Developments

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

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