Zobrazeno 1 - 10
of 204
pro vyhledávání: '"Stolyar, Alexander"'
Autor:
Stolyar, Alexander
A service system with multiple types of customers, arriving as Poisson processes, is considered. The system has infinite number of servers, ranked by $1,2,3, \ldots$; a server rank is its ``location." Each customer has an independent exponentially di
Externí odkaz:
http://arxiv.org/abs/2407.01841
Autor:
Ernst, Philip, Stolyar, Alexander
We revisit a classical problem in dynamic storage allocation. Items arrive in a linear storage medium, modeled as a half-axis, at a Poisson rate $r$ and depart after an independent exponentially distributed unit mean service time. The arriving item s
Externí odkaz:
http://arxiv.org/abs/2404.03797
Autor:
Baryshnikov, Yuliy, Stolyar, Alexander
We study a system consisting of $n$ particles, moving forward in jumps on the real line. Each particle can make both independent jumps, whose sizes have some distribution, or ``synchronization'' jumps, which allow it to join a randomly chosen other p
Externí odkaz:
http://arxiv.org/abs/2311.17052
Autor:
Stolyar, Alexander
We consider a system consisting of $n$ particles, moving forward in jumps on the real line. System state is the empirical distribution of particle locations. Each particle ``jumps forward'' at some time points, with the instantaneous rate of jumps gi
Externí odkaz:
http://arxiv.org/abs/2206.01827
Autor:
Gopalan, Aditya, Stolyar, Alexander
We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network vi
Externí odkaz:
http://arxiv.org/abs/2110.09648
Autor:
Stolyar, Alexander
We consider a parallel server system with so-called cancel-on-completion redundancy. There are $n$ servers and multiple job classes $j$. An arriving class $j$ job consists of $d_j$ components, placed on a randomly selected subset of servers; the job
Externí odkaz:
http://arxiv.org/abs/2105.14143
Autor:
Shneer, Seva, Stolyar, Alexander
A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs consist of m
Externí odkaz:
http://arxiv.org/abs/2006.11256
Autor:
Stolyar, Alexander
We use probabilistic methods to study properties of mean-field models, arising as large-scale limits of certain particle systems with mean-field interaction. The underlying particle system is such that $n$ particles move forward on the real line. Spe
Externí odkaz:
http://arxiv.org/abs/2004.00177
Autor:
Shneer, Seva, Stolyar, Alexander
We study the following interacting particle system. There are $\rho n$ particles, $\rho < 1$, moving clockwise ("right"), in discrete time, on $n$ sites arranged in a circle. Each site may contain at most one particle. At each time, a particle may mo
Externí odkaz:
http://arxiv.org/abs/1905.03860
Autor:
Shneer, Seva, Stolyar, Alexander
We study networks of interacting queues governed by utility-maximising service-rate allocations in both discrete and continuous time. For {\em finite} networks we establish stability and some steady-state moment bounds under natural conditions and ra
Externí odkaz:
http://arxiv.org/abs/1812.01435