Related papers: Resetting-induced instability in queues fed by a s…
We consider a single server queue which has a threshold to change its arrival process and service speed by its queue length, which is referred to as a two-level single server queue. This model is motivated by an energy saving problem for a…
Effect of noise in inducing order on various chaotically evolving systems is reviewed, with special emphasis on systems consisting of coupled chaotic elements. In many situations it is observed that the uncoupled elements when driven by…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly…
In this paper we deal with stochastic optimization problems where the data distributions change in response to the decision variables. Traditionally, the study of optimization problems with decision-dependent distributions has assumed…
We explore the effect of stochastic resetting on the first-passage properties of space-dependent diffusion in presence of a constant bias. In our analytically tractable model system, a particle diffusing in a linear potential…
The problem of finding a resource residing in a network node (the \emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially…
An encounter-based approach consists in using the boundary local time as a proxy for the number of encounters between a diffusing particle and a target to implement various surface reaction mechanisms on that target. In this paper, we…
Renewal processes are zero-dimensional processes defined by independent intervals of time between zero crossings of a random walker. We subject renewal processes them to stochastic resetting by setting the position of the random walker to…
The deployment of machine learning in high-stakes services relies on ``human-in-the-loop'' architectures to mitigate algorithmic uncertainty. However, existing static policies fail to address a fundamental tension: algorithms suffer from…
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…
Queueing networks are typically modelled assuming that the arrival process is exogenous, and unaffected by admission control, scheduling policies, etc. In many situations, however, users choose the time of their arrival strategically,…
Properties of stochastic systems are defined by the noise type and deterministic forces acting on the system. In out-of-equilibrium setups, e.g., for motions under action of L\'evy noises, the existence of the stationary state is not only…
In modern computer systems, jobs are divided into short tasks and executed in parallel. Empirical observations in practical systems suggest that the task service times are highly random and the job service time is bottlenecked by the…
Rather than directly considering the queuing delay of data, this memo focuses on reducing the delay that congestion signals experience within a queue management algorithm, which can be greater than the delay that the data itself experiences…
We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…
To leverage prediction models to make optimal scheduling decisions in service systems, we must understand how predictive errors impact congestion due to externalities on the delay of other jobs. Motivated by applications where prediction…
A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a…
Delay is an inherent feature of genetic regulatory networks. It represents the time required for the assembly of functional regulator proteins. The protein production process is complex, as it includes transcription, translocation,…
We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate independently, but want to help each other respond to…