Related papers: Critical fluid limit of a gated processor sharing …
Atar and Miyazawa recently introduced a single server queue with queue length dependent arrival and service processes, and name it a multi-level queue. They prove that the heavy traffic limit of its queue length process weakly converges to…
We prove a central limit type theorem for critical marked Hawkes processes. We study the case where the marks are i.i.d. with nonnegative values and their common distribution is either heavy tailed or has finite variance. The kernel…
In this paper, we introduce two algorithms that solve the mutual exclusion problem for concurrent processes that communicate through shared variables, [2]. Our algorithms guarantee that any process trying to enter the critical section,…
A simple fluid, described by point-like particles interacting via the Lennard-Jones potential, is considered under confinement in a slit geometry between two walls at distance Lz apart for densities inside the vapor-liquid coexistence…
A control scheme for the multi-gated perimeter traffic flow control problem of cities is presented. The proposed scheme determines feasible and optimally distributed input flows for the various gates located at the periphery of a protected…
Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…
We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…
In modern computers, computation is performed by assembling together sets of logic gates. Popular gates like AND, OR, XOR, processing two logic inputs and yielding one logic output, are often addressed as irreversible logic gates where the…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
We investigate in this paper the performance of a simple file sharing principle. For this purpose, we consider a system composed of N peers becoming active at exponential random times; the system is initiated with only one server offering…
Intermediately subcritical branching processes in random environment are at the borderline between two subcritical regimes and exhibit a particularly rich behavior. In this paper, we prove a functional limit theorem for these processes. It…
In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…
We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources,…
In this paper we study the power-performance relationship of power-efficient computing from a queuing theoretic perspective. We investigate the interplay of several system operations including processing speed, system on/off decisions, and…
We consider the so-called GI/GI/N queue, in which a stream of jobs with independent and identically distributed service times arrive as a renewal process to a common queue that is served by $N$ identical parallel servers in a…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the…
We consider GI/Ph/n+M parallel-server systems with a renewal arrival process, a phase-type service time distribution, n homogenous servers, and an exponential patience time distribution with positive rate. We show that in the Halfin-Whitt…