Quasi-reversibility of a discrete-time queue and related models
| Autor: | Hideo Osawa |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Independent and identically distributed random variables
Discrete mathematics Sequence Epoch (reference date) Real-time computing Discrete time queue Management Science and Operations Research Time reversibility Computer Science Applications Computational Theory and Mathematics Discrete time and continuous time Queue Random variable Mathematics |
| Zdroj: | Queueing Systems. 18:133-148 |
| ISSN: | 1572-9443 0257-0130 |
| DOI: | 10.1007/bf01158778 |
| Popis: | We consider a discrete-time queueing system and its application to related models. The model is defined byXn+1=Xn+An-Dn+1 with discrete states, whereXn is the queue-length at the nth time epoch,An is the number of arrivals at the start of the nth slot andDn+1 is the number of outputs at the end of the nth slot. In this model, the arrival process {An} is described as a sequence of independently and identically distributed random variables. The departureDn+1 depends only on the system sizeXn+An at the beginning of the time slot. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink