Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
: In this paper we study the Lindley-type equation W = max{0, B − A − W}. Its main characteristic is that it is a non-increasing monotone function in its main argument W. Our m...
Consider a system (e.g. a computer farm or a call center) operating as a M/M/c queue, where c = 1, or 1 < c < ∞, or c = ∞. The system as a whole suffers disastrous break...
We consider a single server Markovian queue with setup times. Whenever this system becomes empty, the server is turned off. Whenever a customer arrives to an empty system, the ser...
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
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...