Lattice path counting and the theory of queues

DOI10.1016/J.JSPI.2010.01.013zbMATH Open1193.60106OpenAlexW2073075580MaRDI QIDQ972819FDOQ972819

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

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

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)

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?)
• Title not available (Why is that?)
• On the enumeration and generation of generalized Dyck words
• Basic analytic combinatorics of directed lattice paths
• Walks in the quarter plane: Kreweras' algebraic model
• Coincidence probabilities
• Multiprocessor systems with reserves and preferences
• Two Parallel Queues Created by Arrivals with Two Demands I
• Title not available (Why is that?)
• Random Walk in a Weyl Chamber
• Title not available (Why is that?)
• Title not available (Why is that?)
• A probabilistic method for lattice path enumeration
• Dual processes to solve single server systems
• Title not available (Why is that?)
• Spectral theory for the differential equations of simple birth and death processes
• Title not available (Why is that?)
• Transient analysis of queues with heterogeneous arrivals
• Two parallel processors with coupled inputs
• Some Aspects of the Random Sequence
• The time-dependent problem for a queue with preemptive priorities
• Title not available (Why is that?)
• Linear recurrences under side conditions
• Simple Random Walk and Rank Order Statistics
• Title not available (Why is that?)
• A new method for solving a class of ballot problems
• Determining the exit time distribution for a closed cyclic network
• On the Karlin-McGregor theorem and applications
• Title not available (Why is that?)

Cited In (6)

• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
• A base-stock inventory model with service differentiation and response time guarantees
• 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
• Lattice path counting and \(M/M/c\) queueing systems
• A combinatorial study of two-periodic random walks
• Waiting times in classical priority queues via elementary lattice path counting

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)