Lattice path counting and the theory of queues

DOI10.1016/J.JSPI.2010.01.013MaRDI QIDQ972819zbMATHOpenAlexFDO

Authors B. E. Eshmatov

Publication date 21 May 2010

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

Full work available at URL https://doi.org/10.1016/j.jspi.2010.01.013

zbMATH Keywords

transient analysislattice pathsMarkovian queuesmultidimensional pathspaths in a quarter plane

Mathematics Subject Classification ID

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

Recommendations

• On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue
• scientific article; zbMATH DE number 1058059
• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Lattice path counting and \(M/M/c\) queueing systems
• Waiting times in classical priority queues via elementary lattice path counting

Cites work

• scientific article; zbMATH DE number 3122006 (Why is no real title available?)
• scientific article; zbMATH DE number 3159049 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3681764 (Why is no real title available?)
• scientific article; zbMATH DE number 3712896 (Why is no real title available?)
• scientific article; zbMATH DE number 50893 (Why is no real title available?)
• scientific article; zbMATH DE number 4128813 (Why is no real title available?)
• scientific article; zbMATH DE number 1300856 (Why is no real title available?)
• scientific article; zbMATH DE number 706393 (Why is no real title available?)
• scientific article; zbMATH DE number 3212585 (Why is no real title available?)
• scientific article; zbMATH DE number 3259556 (Why is no real title available?)
• scientific article; zbMATH DE number 3315813 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3088542 (Why is no real title available?)
• A new method for solving a class of ballot problems
• A probabilistic method for lattice path enumeration
• Basic analytic combinatorics of directed lattice paths
• Coincidence probabilities
• Determining the exit time distribution for a closed cyclic network
• Dual processes to solve single server systems
• Linear recurrences under side conditions
• Multiprocessor systems with reserves and preferences
• On the Karlin-McGregor theorem and applications
• On the enumeration and generation of generalized Dyck words
• Random Walk in a Weyl Chamber
• Simple Random Walk and Rank Order Statistics
• Some Aspects of the Random Sequence
• Spectral theory for the differential equations of simple birth and death processes
• The time-dependent problem for a queue with preemptive priorities
• Transient analysis of queues with heterogeneous arrivals
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two parallel processors with coupled inputs
• Walks in the quarter plane: Kreweras' algebraic model

Cited in

(8)

• Waiting times in classical priority queues via elementary lattice path counting
• A combinatorial study of two-periodic random walks
• A base-stock inventory model with service differentiation and response time guarantees
• Weighted Dyck paths and nonstationary queues
• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
• Lattice path counting and \(M/M/c\) queueing systems
• A combinatorial model for lane merging
• On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue

This page was built for publication: Lattice path counting and the theory of queues

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