Related papers: Queueing systems with renovation vs. queues with R…
A graph-theoretic analysis of the steady-state behavior of an open Jackson queueing network is developed. In particular, a number of queueing-network performance metrics are shown to exhibit a spatial dependence on local drivers (e.g.…
IIn this paper, we consider an M^X/M/c queue with state-dependent control at idle time and catastrophes. Properties of the queues which terminate when the servers become idle are firstly studied. Recurrence, equilibrium distribution and…
Motivated by interest in providing more efficient services in customer service systems, we use statistical learning methods and delay history information to predict the conditional distribution of the customers' waiting times in queueing…
In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…
Recurrence and ergodic properties are established for a single--server queueing system with variable intensities of arrivals and service. Convergence to stationarity is also interpreted in terms of reliability theory.
Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the…
Recently, hybrid-automatic-repeat-request (HARQ) systems have been favored in particular state-of-the-art communications systems since they provide the practicality of error detections and corrections aligned with repeat-requests when…
The interest to retrial queueing systems is due to their application to telephone systems. The paper studies multiserver retrial queueing systems with $n$ servers. Arrival process is a quite general point process. An arriving customer…
We consider a renewal-reward process with multivariate rewards. Such a process is constructed from an i.i.d.\ sequence of time periods, to each of which there is associated a multivariate reward vector. The rewards in each time period may…
The problems arising when the moments of service time distributions, for which the MGinf queue system busy period and busy cycle become very easy to study, are presented and it is shown how to overcome them. The busy cycle renewal function…
The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine the architecture, motivated by its potential to turn off…
To be effective in sequential data processing, Recurrent Neural Networks (RNNs) are required to keep track of past events by creating memories. While the relation between memories and the network's hidden state dynamics was established over…
We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival…
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.…
We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time…
We consider Markov processes, which describe e.g. queueing network processes, in a random environment which influences the network by determining random breakdown of nodes, and the necessity of repair thereafter. Starting from an explicit…
The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing…
Optimal maintenance policies play an important role in the reliability analysis of repairable systems. This paper examines a two-unit priority standby system with a repair facility, where the priority unit is subject to preventive…
In queuing theory and related problems, it is very important to know the numerical characteristics of an investigated system - both in stationary and non-stationary modes. In some cases, such characteristics can be calculated, but this is…
This paper presents a new condition for the existence of optimal stationary policies in average-cost continuous-time Markov decision processes with unbounded cost and transition rates, arising from controlled queueing systems. This…