260,031 research outputs found
Low latency via redundancy
Low latency is critical for interactive networked applications. But while we
know how to scale systems to increase capacity, reducing latency --- especially
the tail of the latency distribution --- can be much more difficult. In this
paper, we argue that the use of redundancy is an effective way to convert extra
capacity into reduced latency. By initiating redundant operations across
diverse resources and using the first result which completes, redundancy
improves a system's latency even under exceptional conditions. We study the
tradeoff with added system utilization, characterizing the situations in which
replicating all tasks reduces mean latency. We then demonstrate empirically
that replicating all operations can result in significant mean and tail latency
reduction in real-world systems including DNS queries, database servers, and
packet forwarding within networks
Blind Demixing for Low-Latency Communication
In the next generation wireless networks, lowlatency communication is
critical to support emerging diversified applications, e.g., Tactile Internet
and Virtual Reality. In this paper, a novel blind demixing approach is
developed to reduce the channel signaling overhead, thereby supporting
low-latency communication. Specifically, we develop a low-rank approach to
recover the original information only based on a single observed vector without
any channel estimation. Unfortunately, this problem turns out to be a highly
intractable non-convex optimization problem due to the multiple non-convex
rankone constraints. To address the unique challenges, the quotient manifold
geometry of product of complex asymmetric rankone matrices is exploited by
equivalently reformulating original complex asymmetric matrices to the
Hermitian positive semidefinite matrices. We further generalize the geometric
concepts of the complex product manifolds via element-wise extension of the
geometric concepts of the individual manifolds. A scalable Riemannian
trust-region algorithm is then developed to solve the blind demixing problem
efficiently with fast convergence rates and low iteration cost. Numerical
results will demonstrate the algorithmic advantages and admirable performance
of the proposed algorithm compared with the state-of-art methods.Comment: 14 pages, accepted by IEEE Transaction on Wireless Communicatio
Communication Strategies for Low-Latency Trading
The possibility of latency arbitrage in financial markets has led to the
deployment of high-speed communication links between distant financial centers.
These links are noisy and so there is a need for coding. In this paper, we
develop a gametheoretic model of trading behavior where two traders compete to
capture latency arbitrage opportunities using binary signalling. Different
coding schemes are strategies that trade off between reliability and latency.
When one trader has a better channel, the second trader should not compete.
With statistically identical channels, we find there are two different regimes
of channel noise for which: there is a unique Nash equilibrium yielding ties;
and there are two Nash equilibria with different winners.Comment: Will appear in IEEE International Symposium on Information Theory
(ISIT), 201
Ultra-Reliable and Low Latency Communication in mmWave-Enabled Massive MIMO Networks
Ultra-reliability and low-latency are two key components in 5G networks. In
this letter, we investigate the problem of ultra-reliable and low-latency
communication (URLLC) in millimeter wave (mmWave)-enabled massive
multiple-input multiple-output (MIMO) networks. The problem is cast as a
network utility maximization subject to probabilistic latency and reliability
constraints. To solve this problem, we resort to the Lyapunov technique whereby
a utility-delay control approach is proposed, which adapts to channel
variations and queue dynamics. Numerical results demonstrate that our proposed
approach ensures reliable communication with a guaranteed probability of
99.99%, and reduces latency by 28.41% and 77.11% as compared to baselines with
and without probabilistic latency constraints, respectively.Comment: Accepted May 12, 2017 by IEEE Communications Letters. Topic is
Ultra-Reliable and Low Latency Communication in 5G mmWave Network
- …