scientific article; zbMATH DE number 4211233

MaRDI QIDQ3358023zbMATH OpenFDO

Authors

Publication date 1990

zbMATH Keywords

discrete-time analogue of a one-server queuelattice pathsrandom walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• A transient solution to an M/M/1 queue: a simple approach
• Transient analysis of the M/M/1 queue
• Publication:3212100
• The transient solution of time-dependent M/M/1 queues
• scientific article; zbMATH DE number 1045887

Cited in

(13)

• A first-passage time random walk distribution with five transition probabilities: a generalization of the shifted inverse trinomial
• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• Combinatorial approach to Markovian queueing models
• Distribution of number served during a busy period of GI/M/1/N queues: Lattice path approach
• Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions
• Lattice path counting and \(M/M/c\) queueing systems
• A comparative analysis of the successive lumping and the lattice path counting algorithms
• scientific article; zbMATH DE number 4194902 (Why is no real title available?)
• First-crossing and ballot-type results for some nonstationary sequences
• Lattice paths combinatorics applied to transient queue length distribution of C\(_2/\)M/1 queues and busy period analysis of bulk queues C\(_2^b/\)M/1
• Decomposition of the M/M/1 transition function

This page was built for publication:

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