Real-time queueing theory

John P. Lehoczky

199 citations0/0 files storedProceedings/Proceedings - Real-Time Systems Symposium

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 Real-Time Systems Scheduling Age of Information Optimization

Abstract

The paper presents an approach to real time system scheduling. The approach, called real time queueing theory, includes customer timing requirements into queueing models. With real time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead time profile process where lead time=deadline minus current time. In spite of the infinite dimensionality of these processes, in the heavy traffic case, a simple description of lead time profile process is presented, and this description is shown to be very accurate when compared against simulations. Real time queueing theory offers the promise of providing real time system predictability for systems characterized by substantial stochastic behavior (such as ATM networks and multimedia systems). Possible generalizations are discussed.

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

References

1987Brownian Motion and Stochastic Flow Systems.1995On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models 1988Brownian Models of Queueing Networks with Heterogeneous Customer Populations 1990Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network

Cited by

2001Real-time queues in heavy traffic with earliest-deadline-first queue discipline 2002Real-time queueing network theory 2008Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic 2011Heavy traffic analysis for EDF queues with reneging 2018Heavy traffic analysis for EDF queues with reneging 2004On the optimal allocation of service to impatient tasks 2018Deadline Scheduling as Restless Bandits 2007Modeling human activity in the spirit of Barabasi’s queueing systems

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.