Rate conservation principle for discrete-time queues
From MaRDI portal
Publication:1205353
DOI10.1007/BF01158799zbMath0811.60078OpenAlexW1998370593MaRDI QIDQ1205353
Masakiyo Miyazawa, Yoshitaka Takahashi
Publication date: 1 April 1993
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158799
Palm distributionASTAdiscrete-time queuesstationary point processLittle's formularate conservation principleBrumelle's formula
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
Palm calculus for a process with a stationary random measure and its applications to fluid queues ⋮ Marked point processes in discrete time ⋮ Periodic Little’s Law ⋮ Rate conservation laws: A survey ⋮ A note on the discretization of Little's result
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Delay analysis of discrete-time priority queue with structured inputs
- Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
- EPSTA: The coincidence of time-stationary and customer-stationary distributions
- Sample-path analysis of processes with imbedded point processes
- The derivation of invariance relations in complex queueing systems with stationary inputs
- Integration of Discrete-Time Correlated Markov Processes in a TDM System
- On Arrivals That See Time Averages
- The intensity conservation law for queues with randomly changed service rate
- Poisson Arrivals See Time Averages
- Time and customer processes in queues with stationary inputs
- Stochastic processes with imbedded marked point processes (pmp) and thcir application in queneing
- On the relation between customer and time averages in queues
- Piecewise Markov Processes
This page was built for publication: Rate conservation principle for discrete-time queues