相关论文: Queueing with neighbours

Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…

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…

Collective movement is observed widely in nature, where individuals interact locally to produce globally ordered, coherent motion. In typical models of collective motion, each individual takes the average direction of multiple neighbors,…

In the supermarket model there are n queues, each with a unit rate server. Customers arrive in a Poisson process at rate \lambda n, where 0<\lambda <1. Each customer chooses d > 2 queues uniformly at random, and joins a shortest one. It is…

Three state-of-the-art adaptive population control strategies (PCS) are theoretically and empirically investigated for a multi-recombinative, cumulative step-size adaptation Evolution Strategy $(\mu/\mu_I, \lambda)$-CSA-ES. First, scaling…

In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…

In this paper, we exploit results obtained in an earlier study for the Laplace transform of the sojourn time $\Omega$ of an entire batch in the $M^{[X]}/M/1$ Processor Sharing (PS) queue in order to derive the asymptotic behavior of the…

We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring's weights and their number may depend on the mother's weight. Our setting captures, for instance, the processes…

In a growth-fragmentation system, cells grow in size slowly and split apart at random. Typically, the number of cells in the system grows exponentially and the distribution of the sizes of cells settles into an equilibrium 'asymptotic…

We analyze a stochastic particle system of 5 neighbors. Considering eigenvalue problem of transition matrix, we propose a conjecture that asymptotic distribution of the system is determined by the number of specific local patterns in the…

We propose a new queueing model, motivated by the phenomenon of pseudoprogression in cancer, in which the length of a queue appears to increase initially, before reducing to a steady state. We assume that servers arrive to the queue…

We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions…

We generalize the ordinary aggregation process to allow for choice. In ordinary aggregation, two random clusters merge and form a larger aggregate. In our implementation of choice, a target cluster and two candidate clusters are randomly…

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

We study the long-time behavior of stochastic models with an absorbing state, conditioned on survival. For a large class of processes, in which saturation prevents unlimited growth, statistical properties of the surviving sample attain…

A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…

Consider compound Poisson processes with negative drift and no negative jumps, which converge to some spectrally positive L\'evy process with non-zero L\'evy measure. In this paper we study the asymptotic behavior of the local time process,…

For a large family of nonautonomous scalar-delayed differential equations used in population dynamics, some criteria for permanence are given, as well as explicit upper and lower bounds for the asymptotic behavior of solutions. The method…

The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation, where the step size is adapted measuring the length of a so-called cumulative path. The cumulative path is a combination of the previous steps realized by the…

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…