Related papers: Overlapping time of a virtual customer in time-var…
The prospect of combining human operators and virtual agents (bots) into an effective hybrid system that provides proper customer service to clients is promising yet challenging. The hybrid system decreases the customers' frustration when…
Estimating the causal effect of a time-varying public health intervention on the course of an infectious disease epidemic is an important methodological challenge. During the COVID-19 pandemic, researchers attempted to estimate the effects…
We study a simple rate control scheme for a multiclass queuing network for which customers are partitioned into distinct flows that are queued separately at each station. The control scheme discards customers that arrive to the network…
Transient cloud servers such as Amazon Spot instances, Google Preemptible VMs, and Azure Low-priority batch VMs, can reduce cloud computing costs by as much as $10\times$, but can be unilaterally preempted by the cloud provider.…
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…
In this paper, we propose a new measure for detecting overlap in multivariate Gaussian clusters. The aim of online learning from data streams is to create clustering, classification, or regression models that can adapt over time based on…
In this paper, a mixed integer linear formulation for problems considering time-of-use-type constraints for uninterruptible services is presented. Our work is motivated by demand response problems in power systems, in which certain devices…
We consider a heterogeneous queueing system consisting of one large pool of $O(r)$ identical servers, where $r\to\infty$ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in…
We study a single server queue under a processor-sharing type of scheduling policy, where the weights for determining the sharing are given by functions of each job's remaining service(processing) amount, and obtain a fluid limit for the…
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…
We use an Ornstein--Uhlenbeck (OU) process to approximate the queue length process in a $GI/GI/n+M$ queue. This one-dimensional diffusion model is able to produce accurate performance estimates in two overloaded regimes: In the first…
The parallel execution of requests in a Cloud Computing platform, as for Virtualized Network Functions, is modeled by an $M^{[X]}/M/1$ Processor-Sharing (PS) system, where each request is seen as a batch of unit jobs. The performance of…
A key operational challenge for call centers is to decide, in real time, which waiting customer should be served by which available agent. This is known as skill-based routing, and the decision becomes especially difficult in large systems…
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…
The spread of viruses in biological networks, computer networks, and human contact networks can have devastating effects; developing and analyzing mathematical models of these systems can be insightful and lead to societal benefits. Prior…
In this paper, we consider queueing systems where the dynamics are non-stationary and state-dependent. For performance analysis of these systems, fluid and diffusion models have been typically used. Although they are proven to be…
In this paper we present the fluid limit of an heavily loaded Earliest Deadline First queue with impatient customers, represented by a measure-valued process keeping track of residual time-credits of lost and waiting customers. This fluid…
In this study, we consider multi-class multi-server asymmetric queueing systems consisting of $N$ queues on one side and $K$ servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server…
Visual analysis of temporal networks comprises an effective way to understand the network dynamics, facilitating the identification of patterns, anomalies, and other network properties, thus resulting in fast decision making. The amount of…
We consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by…