Filtering formulas and the ./M/1 queue in a quasireversible network
- 15 December 1981
- journal article
- research article
- Published by Taylor & Francis in Stochastics
- Vol. 6 (1) , 1-22
- https://doi.org/10.1080/17442508108833188
Abstract
This paper proposes an elementary justification of the filtering formulas for a Markov chain and an analysis of the arrival and departure processes at a ./M/1 queue in a quasireversible network. It is shown that the interarrival time distributions of the two above mentioned processes are always identical under equilibrium. This generalizes the corresponding result proved for Jackson networks in [1]. An example shows that the those two prrcesses do not necessarily have the same law even if the network outside of the o M,T node is reversible and if there is no immediate feedback on that node. This contradicts a conjecture made in [2].Keywords
This publication has 12 references indexed in Scilit:
- Interconnections of Markov chains and quasi-reversible queuing networksStochastic Processes and their Applications, 1980
- On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theoryAdvances in Applied Probability, 1979
- Calcul Stochastique et Problèmes de MartingalesLecture Notes in Mathematics, 1979
- On the output theorem of queueing theory, via filteringJournal of Applied Probability, 1978
- Processus ponctuels et martingales: résultats récents sur la modélisation et le filtrageAdvances in Applied Probability, 1977
- Filtering, Prediction and Smoothing for Counting Process Observations, a Martingale ApproachSIAM Journal on Applied Mathematics, 1977
- Estimation de l'État d'une file d'attente et du temps de panne d'une machine par la méthode de semi-martingalesAdvances in Applied Probability, 1975
- Martingales on Jump Processes. II: ApplicationsSIAM Journal on Control, 1975
- Markov Chains with Stationary Transition ProbabilitiesPublished by Springer Nature ,1960
- Networks of Waiting LinesOperations Research, 1957