Filtering formulas and the ./M/1 queue in a quasireversible network

DOI10.1080/17442508108833188zbMath0475.60081OpenAlexW1992224023MaRDI QIDQ3930433

Jean Walrand

Publication date: 1981

Published in: Stochastics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17442508108833188

zbMATH Keywords

queueing networkfiltering formulasquasireversible network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic integrals (60H05)

Related Items

Probabilistic proof of the interchangeability of ./M/1 queues in series, Algorithm of Balance Equations Decomposition and Investigation of Poisson Flows in Jackson Networks, Theory of queuing networks and its applications to the analysis of information-computing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calcul stochastique et problèmes de martingales
• Interconnections of Markov chains and quasi-reversible queuing networks
• Prediction and smoothing for partially observed Markov chains
• Estimation de l'État d'une file d'attente et du temps de panne d'une machine par la méthode de semi-martingales
• Processus ponctuels et martingales: résultats récents sur la modélisation et le filtrage
• Martingales on Jump Processes. II: Applications
• Filtering, Prediction and Smoothing for Counting Process Observations, a Martingale Approach
• State-of-the-Art—Networks of Queues—A Survey of Equilibrium Analysis
• On the output theorem of queueing theory, via filtering
• On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory