Related papers: Improving the performance of polling models using …
We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any,…
In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…
We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to…
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When…
The infinite servers queue with Poisson arrivals state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which results it is…
We consider a token bucket mechanism serving a heterogeneous flow with a focus on backlog, delay and packet loss properties. Previous models have considered the case for fixed size packets, i.e. "one token per packet" with and M/D/1 view on…
A new model for the dynamics of opinion formation is proposed and analysed at the mean-field level. It can be regarded as a generalization of the noisy voter model in which agents update their binary states by copying others and by an…
We consider a dynamic server allocation problem over parallel queues with randomly varying connectivity and server switchover delay between the queues. At each time slot the server decides either to stay with the current queue or switch to…
We consider a polling model with multiple stations, each with Poisson arrivals and a queue of infinite capacity. The service regime is exhaustive and there is Jacksonian feedback of served customers. What is new here is that when the server…
We consider the FCFS $GI/GI/n$ queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exist $\epsilon_1,…
We consider a hierarchical network that consists of mobile users, a two-tiered cellular network (namely small cells and macro cells) and central routers, each of which follows a Poisson point process (PPP). In this scenario, small cells…
In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic…
There are two contributions to the literature in this note. Firstly, we point out that under some weak conditions the result in Swensen (1986) on the remaining loads in a GI/M/$c$ queue with impatient customers, derived under the assumption…
We consider a status update system consisting of a sampler, a sink, and a controller located at the sink. The controller sends requests to the sampler to generate and transmit status updates. Packet transmissions from the controller to the…
Different people have different habits of describing their intents in conversations. Some people tend to deliberate their intents in several successive utterances, i.e., they use several consistent messages for readability instead of a long…
We study the steady-state delay performance of load balancing in large-scale systems with heterogeneous servers in the heavy-traffic regimes. The system consists of $N$ servers, each with a local buffer of size $b-1$, serving jobs in the…
We analyze a network of tandem polling queues with two stations operating under synchronized polling (SP) and out-of-sync polling (OP) strategies, and with nonzero setups. We conduct an exact analysis using a decomposition approach to…
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…