Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1906.00374

Effect of two forms of feedback on the performance of the Rate Control Protocol (RCP)

Abuthahir Abuthahir·Nizar Malangadan·Gaurav Raina
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Rate Control Protocol (RCP) uses explicit feedback from routers to control network congestion. RCP estimates it's fair rate from two forms of feedback: rate mismatch and queue size. An important design question that remains open in RCP is whether the presence of queue size feedback is helpful, given the presence of feedback from rate mismatch. The feedback from routers to end-systems is time delayed, and may introduce instabilities and complex non-linear dynamics. Delay dynamical systems are often modeled using delay differential equations to facilitate a mathematical analysis of their performance and dynamics. The RCP models with and without queue size feedback give rise to two distinct non-linear delay differential equations. Earlier work on this design question was based on methods of linear systems theory. For further progress, it is quite natural to employ nonlinear techniques. In this study, we approach this design question using tools from control and bifurcation theory. The analytical results reveal that the removal of queue feedback could enhance both stability and convergence properties. Further, using Poincaré normal forms and center manifold theory, we investigate two nonlinear properties, namely, the type of Hopf bifurcation and the asymptotic stability of the bifurcating limit cycles. We show that the presence of queue feedback in the RCP can lead to a sub-critical Hopf bifurcation, which would give rise either to the onset of large amplitude limit cycles or to unstable limit cycles. Whereas, in the absence of queue feedback, the Hopf bifurcation is always super-critical and the bifurcating limit cycles are stable. The analysis is complemented with computations and some packet-level simulations as well. In terms of design, our study suggests that the presence of both forms of feedback may be detrimental to the performance of RCP.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abuthahir Abuthahir, Nizar Malangadan, Gaurav Raina. 2019-06-02. Effect of two forms of feedback on the performance of the Rate Control Protocol (RCP). https://doi.org/10.1016/j.cnsns.2020.105225

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

CSI Simulation: Why Additive Noise Fails and How to Fix It

Channel State Information (CSI) has become a widely used wireless channel sensing modality for applications such as indoor localization, activity recognition, and respiration monitoring. Because collecting labeled data under every target condition is impractical, training CSI-based models often relies on simulated data produced by adding noise or perturbations to recorded channel estimates, most commonly additive white Gaussian noise (AWGN). This practice assumes that the receiver chain between the antenna and the channel estimator is linear and gain-invariant. We test this assumption empirically using RF jamming as a controlled perturbation on 6 commodity receivers across 2 indoor environments. The assumption does not hold. Automatic gain control compresses the channel estimate multiplicatively before digitization, producing amplitude distributions that no additive noise variance can reproduce. To close the resulting fidelity gap, we propose M_QTC, a measurement-calibrated model that learns the per-subcarrier distribution transformation through quantile mapping, temporal filtering, and copula-based cross-subcarrier reordering. M_QTC reduces amplitude error 8-fold and closes 89% of the aggregate fidelity gap across four complementary dimensions. The improvement transfers directly to downstream tasks, where 5 classifiers from different families trained on M_QTC-simulated data recover 93% of real-data jamming detection performance, while AWGN-trained classifiers remain near random decision.

cs.NI↗
arXiv2026

BALANCE: Hybrid Autoregressive-Speculative LLM Inference at the Network Edge

Edge inference is a promising paradigm to provide large language model (LLM) inference services in next-generation mobile networks. LLM inference mainly relies on two approaches: Autoregressive decoding (AD) generates output tokens sequentially, resulting in long latency; Speculative decoding (SD) accelerates inference by using a small language model (SLM) to generate multiple draft tokens for LLM verification, but incurs extra memory costs. Due to this latency-memory tradeoff, neither approach alone can efficiently serve users with heterogeneous demands under limited edge computing resources. To address this challenge, we propose a hybrid autoregressive-speculative inference (BALANCE) framework for edge LLM inference. In BALANCE, an edge server hosts both an SLM and an LLM, admits users, assigns each admitted user to the AD or SD mode, and performs the two modes simultaneously. To maximize the number of served users, we formulate a task throughput maximization problem to jointly determine user admission and computing resource allocation between AD and SD under user latency requirements and server memory constraints. Since the problem is NP-hard, we develop a polynomial-time algorithm that transforms the original problem into two sub-problems and obtains a sub-optimal solution with a constant approximation guarantee. Experiments demonstrate that BALANCE consistently outperforms conventional AD and SD and significantly improves task throughput.

cs.NI↗
arXiv2026

Zero-Knowledge Remote Adversarial Attack against Wi-Fi-based Human Activity Recognition for Privacy Protection

The growing capability of Wi-Fi devices to identify human activities using channel state information (CSI) raises privacy concerns. To counter this threat, we propose GRAW, an adversary system, acting as a privacy defender, that degrades the human activity recognition (HAR) system at the user device by perturbing the router's signals that the device uses to estimate CSI. GRAW employs generative adversarial imitation learning (GAIL) to construct perturbation signals, and thereby eliminates the need for any information on the target HAR systems and their inputs (i.e., zero-knowledge operation). We evaluate GRAW against seven representative HAR models, using datasets collected in five environments, including our own dataset. We observe that GRAW is the only remote attack scheme that degrades every tested HAR model to a random-selection level. At the same perturbation level, GRAW achieves an attack success ratio up to 76.7% higher than comparison methods, while maintaining over 99% packet success rate on regular Wi-Fi communication. We demonstrate the feasibility of GRAW through real-time, over-the-air experiments with software-defined radios.

cs.NI↗