Related papers: On The Waiting Time for A M/M/1 Queue with Impatie…
We consider a general polling model with $N$ stations. The stations are served exhaustively and in cyclic order. Once a station queue falls empty, the server does not immediately switch to the next station. Rather, it waits at the station…
We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…
Email is a ubiquitous communications tool in the workplace and plays an important role in social interactions. Previous studies of email were largely based on surveys and limited to relatively small populations of email users within…
In this paper we prove Aldous's conjecture from 1987 that there is no backoff protocol that is stable for any positive arrival rate. The setting is a communication channel for coordinating requests for a shared resource. Each user who wants…
We consider an M/M/1 feedback queue in which service attempts may fail, requiring the customer to rejoin the queue. Arriving customers act strategically, deciding whether to join the queue based on a threshold strategy that depends on the…
An exact formula for the equilibrium M/U/1 waiting time density is now effectively known. What began as a numeric exploration became a symbolic banquet. Inverse Laplace transforms provided breadcrumbs in the trail; delay differential…
A telegraph process with an elastic barrier at the origin was studied in [5]; in particular the number of visits of the origin before the absorption is a geometric distributed random variable M. Some asymptotic results (large and moderate…
The motion of an air-fluid interface through an irregularly coated capillary is studied by analysing the Lucas-Washburn equation with a random capillary force. The pinning probability goes from zero to a maximum value, as the interface…
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 consider the distribution of the length of the longest subsequence avoiding a given pattern in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to avoiding the pattern 21. We show…
In a recent preprint \cite{eck}, the temporal dynamics of an e-mail network has been investigated by J.P. Eckmann, E. Moses and D. Sergi. Specifically, the time period between an e-mail message and its reply were recorded. It will be shown…
We consider a sequence of quantized Lorentzian pulses of non-interacting electrons impinging on a quantum point contact (QPC) and study the waiting time distribution (WTD), for any transmission and any number of pulses. As the degree of…
In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…
The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate $\rho$ and decoding delay $d$---the elapsed time between when information is available at the transmitter and when it…
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their…
Let $V$ be an $n$-set, and let $X$ be a random variable taking values in the powerset of $V$. Suppose we are given a sequence of random coupons $X_1, X_2, \ldots $, where the $X_i$ are independent random variables with distribution given by…
In this paper we address two basic questions in wireless communication: First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…
We investigate the statistics of the number of time slots $T$ that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interference model for which interference possesses spatiotemporal…
A pattern $\alpha$ is a string of variables and terminal letters. We say that $\alpha$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $\alpha$ by terminal words. The matching…