In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
We analyze a multi-server priority queueing system with partial buffer sharing, where the input is a discrete autoregressive process of order 1 (DAR(1)) which is known as a good m...
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Abstract All-optical packet switched networking is hampered by the problem of realizing viable queues for optical packets. Packets can be buffered in delay lines, but delay linesdo...