Combinatorial approach to Markovian queueing models

DOI10.1016/0378-3758(93)90011-TzbMATH Open0766.60117OpenAlexW2056411352MaRDI QIDQ1209660FDOQ1209660

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• Title not available (Why is that?)
• The Distribution of the Maximum Length of a Poisson Queue During a Busy Period
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy

Cited In (13)

• 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
• Busy period analysis of queue: lattice path approach
• 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
• 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
• Transient analysis of queues with heterogeneous arrivals
• Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
• Lattice path counting and \(M/M/c\) queueing systems
• Title not available (Why is that?)
• Algorithmic Computation of the Time-Dependent Solution of Structured Markov Chains and Its Application to Queues
• On zero-avoiding transition probabilities of an r-node tandem queue: a combinatorial approach
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy

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)