相关论文: Steady-State Analysis and Online Learning for Queu…

We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon…

Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of load balancing algorithms is to achieve an optimal trade-off…

This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in…

Hawkes processes are a class of point processes that have the ability to model the self- and mutual-exciting phenomena. Although the classic Hawkes processes cover a wide range of applications, their expressive ability is limited due to…

We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are impatient and abandon if they do not receive service after…

We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…

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…

Queue length monitoring is a commonly arising problem in numerous applications such as queue management systems, scheduling, and traffic monitoring. Motivated by such applications, we formulate a queue monitoring problem, where there is a…

Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request…

We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…

A discrete-time batch service queue with batch renewal input and random serving capacity rule under the late arrival delayed access system (LAS-DA), has recently appeared in the literature [2]. In this paper, we consider the same model…

Proper management of resources whose arrival and consumption are subject to environmental randomness is an intrinsic process in both natural and artificial systems. This phenomenon can be modeled as a queuing process whose arrival…

Efficiently exploiting servers in data centers requires performance analysis methods that account not only for the stochastic nature of demand but also for server heterogeneity. Although several recent works proved optimality results for…

This paper studies queueing problems with an endogenous number of machines with and without an initial queue, the novelty being that coalitions not only choose how to queue, but also on how many machines. For a given problem, agents can…

We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue…

Heterogeneity is becoming increasingly ubiquitous in modern large-scale computer systems. Developing good load balancing policies for systems whose resources have varying speeds is crucial in achieving low response times. Indeed, how best…

The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise the average delay of jobs in homogeneous systems consisting of identical servers. However, it performs poorly in heterogeneous systems where servers have different…

We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a…

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 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,…