Finite-Source Priority Queues

N. K. Jaiswal

15 citations0/0 files storedSIAM Journal on Applied Mathematics

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 Optimization and Search Problems Age of Information Optimization

Abstract

The effect of assuming priorities in multiple finite-source queuing models is studied in which k ≥ 2 types of units emanate from independent sources, at least one of which is finite. Results are derived for k = 2, assuming preemptive resume, repeat and head-of-the-line priority disciplines. Extensions for k > 2 are pointed out.

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

References

1962A Waiting Line with Interrupted Service, Including Priorities 1963Some Queuing Problems with the Service Station Subject to Breakdown 1959Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous Time 1962Queues Subject to Service Interruption 1965Preemptive Priority Queues 1963Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem—I

Cited by

1990Multiple finite source queueing model with dynamic priority scheduling 1983A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model

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.