Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
Stationary deterministic flows: II. the single-server queue
Theoretical Computer Science
Queues with nonstationary inputs
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Sample-path analysis of processes with imbedded point processes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
The pointwise stationary approximation for M1/M1/s
Management Science
Cyclic strong ergodicity in nonhomogeneous Markov systems
SIAM Journal on Matrix Analysis and Applications
Deterministic analysis of queueing systems with heterogeneous servers
Theoretical Computer Science
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
The physics of the Mt/G/ ∞ symbol Queue
Operations Research
Unstable asymptotics for nonstationary queues
Mathematics of Operations Research
Strong approximations for time-dependent queues
Mathematics of Operations Research
Diffusion Approximations for Computer/Communications Systems
Proceedings of the International Workshop on Computer Performance and Reliability
An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and Service
Queueing Systems: Theory and Applications
On Existence of Limiting Distribution for Time-Nonhomogeneous Countable Markov Process
Queueing Systems: Theory and Applications
Some universal limits for nonhomogeneous birth and death processes
Queueing Systems: Theory and Applications
Mean characteristics of Markov queueing systems
Automation and Remote Control
Queueing Systems: Theory and Applications
Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks
INFORMS Journal on Computing
| Hi-index | 0.00 |
The exact transient distribution of the queue length of the M_t/M_t/1 single server queue with time-dependent Poisson arrival rate and time-dependent exponential service rate was recently obtained by Zhang and Coyle [63] in terms of a solution to a Volterra equation. Their method involved the use of generating functions and complex analysis. In this paper, we present an approach that ties the computation of these transient distributions directly to the random sample path behavior of the M_t/M_t/1 queue. We show the versatility of this method by applying it to the M_t/M_t/c multiserver queue, and indicating how it can be applied to queues with time-dependent phase arrivals or time-dependent phase service.