Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Queues with Service in Random Order
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (18)

Means and variances of time averages in Markovian environments
Algorithms for Markov stochastic models
First passage times for multidimensional denumerable state Markov processes
History of Queueing Theory in Canada Prior to 1980
Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution
Transient solutions for multidimensional denumerable state Markov processes
A matrix-geometric solution of the jockeying problem
First passage times for Markov renewal processes and applications
Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues
Markov chain models of a telephone call center with call blending
Analyses of an M/M/N queue with servers' vacations
Moments computation for general Markov fluid models
On the use of MTBDDs for performability analysis and verification of stochastic systems.
IRAP3: An interactive program for reliability analysis
Stochastic fluid models with positive jumps at level zero
Bounds and Approximations for the Transient Behavior of Continuous-Time Markov Chains
Four Canadian Contributions to Stochastic Modeling
On the transient behavior of a finite birth-death process with an application

This page was built for publication: Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243534)