
doi: 10.1007/bf01154545
A single server performs service at two stations in a cyclic manner. Breakdowns and following repairs of the server can occur both at polling and service times. Assuming Poisson arrival processes to each station and a Poisson process of breakdowns, an approximate analysis of the mean value of the waiting time is presented via the handling of so-called service and polling completion times. A preemptive repeat discipline with always new samples of service and polling times, respectively, is used in the treatment of breakdowns. Numerical results evaluate the deduced formulas.
Poisson arrival processes, polling completion times, Numerical results, Queues and service in operations research, Queueing theory (aspects of probability theory), Performance evaluation, queueing, and scheduling in the context of computer systems, Poisson process of breakdowns
Poisson arrival processes, polling completion times, Numerical results, Queues and service in operations research, Queueing theory (aspects of probability theory), Performance evaluation, queueing, and scheduling in the context of computer systems, Poisson process of breakdowns
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 15 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
