Combinatorial approach to Markovian queueing models

DOI10.1016/0378-3758(93)90011-TMaRDI QIDQ1209660zbMATH OpenOpenAlexFDO

Authors Kanwar Sen, Joti L. Jain

Publication date 16 May 1993

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0378-3758(93)90011-t

zbMATH Keywords

busy periodlattice pathidle periodcombinatorial methodMarkovian queueing models

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Combinatorial probability (60C05)

Recommendations

• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• 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
• The transient solution to a class of Markovian queues
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions

Cites work

• scientific article; zbMATH DE number 3122006 (Why is no real title available?)
• scientific article; zbMATH DE number 3164122 (Why is no real title available?)
• scientific article; zbMATH DE number 4211233 (Why is no real title available?)
• scientific article; zbMATH DE number 3712896 (Why is no real title available?)
• scientific article; zbMATH DE number 486467 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3301915 (Why is no real title available?)
• scientific article; zbMATH DE number 3321723 (Why is no real title available?)
• scientific article; zbMATH DE number 3321724 (Why is no real title available?)
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• The Distribution of the Maximum Length of a Poisson Queue During a Busy Period
• The Trivariate Distribution of the Maximum Queue Length, the Number of Customers Served and the Duration of the Busy Period for the M/G/1 Queueing System

Cited in

(17)

• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• Transient analysis of queues with heterogeneous arrivals
• Waiting times in classical priority queues via elementary lattice path counting
• 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 approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
• 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
• On zero-avoiding transition probabilities of an r-node tandem queue: a combinatorial approach
• Busy period analysis of queue: lattice path approach
• On batch queueing systems: a combinatorial approach
• Transient results for \(M/M/1/c\) queues via path counting
• scientific article; zbMATH DE number 842889 (Why is no real title available?)
• Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions
• Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions
• Weighted Dyck paths and nonstationary queues
• Lattice path counting and \(M/M/c\) queueing systems
• Algorithmic Computation of the Time-Dependent Solution of Structured Markov Chains and Its Application to Queues

This page was built for publication: Combinatorial approach to Markovian queueing models

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