Related papers: Resetting-induced instability in queues fed by a s…
A queue is required when a service provider is not able to handle jobs arriving over the time. In a highly flexible and dynamic environment, some jobs might demand for faster execution at run-time especially when the resources are limited…
Biological systems often consist of a small number of constituents and are therefore inherently noisy. To function effectively, these systems must employ mechanisms to constrain the accumulation of noise. Such mechanisms have been…
Stochastic resetting is a driving mechanism that is known to minimize the first passage time to reach a target, at the cost of energy expenditure. The choice of the physical implementation of each resetting event determines the tradeoff…
A common and effective method for calculating the steady-state distribution of a process under stochastic resetting is the renewal approach that requires only the knowledge of the reset-free propagator of the underlying process and the…
We consider the problem of simultaneous scheduling and resource allocation of an incoming flow of requests to a set of computing units. By representing each computing unit as a node, we model the overall system as a multi-queue scheme.…
We consider the drift and diffusion properties of periodically driven renewal processes. These processes are defined by a periodically time dependent waiting time distribution, which governs the interval between subsequent events. We show…
We replicate a renewal process at random times, which is equivalent to nesting two renewal processes, or considering a renewal process subject to stochastic resetting. We investigate the consequences on the statistical properties of the…
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each of them treating only at most one packet at a time. In the…
Recent trends in information management involve the periodic transcription of data onto secondary devices in a networked environment, and the proper scheduling of these transcriptions is critical for efficient data management. To assist in…
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…
Processes controlled by stochastic synthesis and degradation (SSD) are widespread in biology but their reaction kinetics are not well understood. Using methods borrowed from the theory of resetting processes, we determine the first-passage…
Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
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…
We consider the problem of designing a packet-level congestion control and scheduling policy for datacenter networks. Current datacenter networks primarily inherit the principles that went into the design of Internet, where congestion…
Stochastic processes offer a fundamentally different paradigm of dynamics than deterministic processes, the most prominent example of the latter being Newton's laws of motion. Here, we discuss in a pedagogical manner a simple and…
We study how spatiotemporal chaos in dynamical systems can be controlled by stochastically returning them to their initial conditions. Focusing on discrete nonlinear maps, we analyze how key measures of chaos -- the Lyapunov exponent and…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
Since its inception, control of data congestion on the Internet has been based on stochastic models. One of the first such models was Random Early Detection. Later, this model was reformulated as a dynamical system, with the average queue…
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an…