相关论文: Bridges and networks: Exact asymptotics
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…
In this paper we find asymptotic distribution for some unreliable networks. Using Markov Additive Structure and Adan, Foley, McDonald method, we find the exact asymptotic for the stationary distribution. With the help of MA structure and…
The paper studies closed queueing networks containing a server station and $k$ client stations. The server station is an infinite server queueing system, and client stations are single-server queueing systems with autonomous service, i.e.…
In this paper, we study quasi-stationary distributions of nonlinearly perturbed semi-Markov processes in discrete time. This type of distributions is of interest for the analysis of stochastic systems which have finite lifetimes, but are…
We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic…
In parallel-server systems with a single stream of arrivals (a.k.a. load balancing), Join-the-Shortest-Queue (JSQ) is a popular routing algorithm. There is extensive literature studying this system in various asymptotic regimes, but all…
This paper studies the input queued switch operating under the MaxWeight algorithm when the arrivals are according to a Markovian process. We exactly characterize the heavy-traffic scaled mean sum queue length in the heavy-traffic limit,…
Many complex networks are known to exhibit sudden transitions between alternative steady states with contrasting properties. Such a sudden transition demonstrates a network's resilience, which is the ability of a system to persist in the…
A Markovian model of the evolution of intermittent connections of various classes in a communication network is established and investigated. Any connection evolves in a way which depends only on its class and the state of the network, in…
We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of…
We consider distributed detection problems over adaptive networks, where dispersed agents learn continually from streaming data by means of local interactions. The simultaneous requirements of adaptation and cooperation are achieved by…
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance…
Height fluctuations are studied in the one-dimensional totally asymmetric simple exclusion process with periodic boundaries, with a focus on how late time relaxation towards the non-equilibrium steady state depends on the initial condition.…
We prove a Large Deviation Principle for {\color{blue} jump-Markov } Processes on sparse large disordered network with disordered connectivity. The network is embedded in a geometric space, with the probability of a connection a (scaled)…
We perform network analysis of a system described by the master equation to estimate the lower bound of the steady-state current noise, starting from the level 2.5 large deviation function and using the graph theory approach. When the…
We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…
We consider steady states of dynamics that have an underlying network structure. We study how a steady state responds to small perturbations in the network parameters and how this sensitivity is connected to the network structure. We…
Understanding information exchange and aggregation on networks is a central problem in theoretical economics, probability and statistics. We study a standard model of economic agents on the nodes of a social network graph who learn a binary…