Related papers: Tail asymptotics for monotone-separable networks
Time-stamped data are increasingly available for many social, economic, and information systems that can be represented as networks growing with time. The World Wide Web, social contact networks, and citation networks of scientific papers…
Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate…
This paper serves as a companion to "Asymptotic Product-form Steady-state for Multiclass Queueing Networks with SBP Service Policies in Multi-scale Heavy Traffic." In this short paper, we illustrate the main results of the main paper…
We consider the sums $S_n=\xi_1+\cdots+\xi_n$ of independent identically distributed random variables. We do not assume that the $\xi$'s have a finite mean. Under subexponential type conditions on distribution of the summands, we find the…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
Consider a sequence of i.i.d. random Lipschitz functions $\{\Psi_n\}_{n \geq 0}$. Using this sequence we can define a Markov chain via the recursive formula $R_{n+1} = \Psi_{n+1}(R_n)$. It is a well known fact that under some mild moment…
We consider a linear transport equation on the edges of a network with time-varying coefficients. Using methods for non-autonomous abstract Cauchy problems, we obtain well-posedness of the problem and describe the asymptotic profile of the…
In previous work Majda and McLaughlin computed explicit expressions for the $2N$th moments of a passive scalar advected by a linear shear flow in the form of an integral over ${\bf R}^N$. In this paper we first compute the asymptotics of…
A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called Network Evolution Chain, is a stationary and ergodic stochastic process. Therefore, the Asymptotic…
In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…
Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few results which provide provable…
We consider a stochastic fluid network where the external input processes are compound Poisson with heavy-tailed Weibullian jumps. Our results comprise of large deviations estimates for the buffer content process in the vector-valued…
We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and…
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…
A functional limit theorem is established for the partial-sum process of a class of stationary sequences which exhibit both heavy tails and long-range dependence. The stationary sequence is constructed using multiple stochastic integrals…
We give uniform proofs of tightness and exponential tightness of the sequences of stationary queue lengths in generalised Jackson networks in a number of setups which concern large, normal and moderate deviations.
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…
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary of the quadrant, but may have unbounded jumps in the opposite direction,…
We consider the problem of packet scheduling in single-hop queueing networks, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a…
We consider totally asymmetric simple exclusion processes with n types of particle and holes ($n$-TASEPs) on $\mathbb {Z}$ and on the cycle $\mathbb {Z}_N$. Angel recently gave an elegant construction of the stationary measures for the…