Related papers: Buffer occupancy asymptotics in rate proportional …
An asymptotic technique is presented to characterize the bits/symbol achievable on a representative wireless link in a spatially distributed network with active interferers at correlated positions, N receive diversity branches, and linear…
A class of stochastic processes strongly related to random sums plays an important role in network and in finance. In this paper we study this kind of stochastic process discuss an overtime unchanged parameter and reveal its asymptotic…
Impact of mobility will be increasingly important in future generation wireless services and the related challenges will need to be addressed. Sojourn time, the time duration that a mobile user stays within a cell, is a mobility-aware…
This paper considers optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions…
We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…
In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\lambda n$, with $0<\lambda<1$, and are immediately dispatched to one of…
We strive to use session type technology to prove behavioural properties of fault-tolerant distributed algorithms. Session types are designed to abstractly capture the structure of (even multi-party) communication protocols. The goal of…
Based on a stationary Poisson point process, a wireless network model with random propagation effects (shadowing and/or fading) is considered in order to examine the process formed by the signal-to-interference-plus-noise ratio (SINR)…
The parallel execution of requests in a Cloud Computing platform, as for Virtualized Network Functions, is modeled by an $M^{[X]}/M/1$ Processor-Sharing (PS) system, where each request is seen as a batch of unit jobs. The performance of…
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…
Limit theorems are presented for the rescaled occupation time fluctuation process of a critical finite variance branching particle system in $\mathbb{R}^{d}$ with symmetric $\alpha$-stable motion starting off from either a standard Poisson…
Motivated by applications that involve setting proper staffing levels for multi-server queueing systems with batch arrivals, we present a thorough study of the queue-length process $\{Q(t); t \geq 0\}$, departure process $\{D(t); t \geq…
In this study we aim for a deeper understanding of the power law slope, $\alpha$, of waiting time distributions. Statistically independent events with linear behavior can be characterized by binomial, Gaussian, exponential, or Poissonian…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…
A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each {that employ successive interference cancellation (SIC) for decoding}. We propose…
We consider a heterogeneous queueing system consisting of one large pool of $O(r)$ identical servers, where $r\to\infty$ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in…
Work sharing and work stealing are two scheduling paradigms to redistribute work when performing distributed computations. In work sharing, processors attempt to migrate pending jobs to other processors in the hope of reducing response…
We consider a class of multiplicative processes which, added with stochastic reset events, give origin to stationary distributions with power-law tails -- ubiquitous in the statistics of social, economic, and ecological systems. Our main…