Skip to content
Log in

Similar papers

Conference Open access 2026

Efficiency of Congestion Control within TCP protocol variants

The Transmission Control Protocol (TCP) sees widespread use in modern networking. Its features, such as correction, synchronization, acknowledgement responses allow for simple, seamless network communication between many interconnected computers. As network bandwidth capacity increased, the original TCP standard struggled to maintain reliability with heavy packet overloads. Hence, congestion control algorithms became a mainstream focus during future technical updates of the TCP standard. This paper explores the importance of congestion control algorithms in a multitude of TCP protocol variants and examines their performance using data from physical hardware simulation. With TCP Tahoe, Reno, NewReno and Vegas being the main subjects, by simulating two devices communicating using the TCP protocol, this method reveals that TCP Vegas outperforms the others in terms of reliability, throughput and latency. Having an increase of data transfer capacity as the main goals of technological innovation in the field of networking, the findings of this investigation illustrate the importance of a context-aware system under an environment with strict and rigorous requirements.

Shing Hei Chase Yiu · 0 citations
Conference Jul 2026

Delay and Throughput Analysis of Prioritized EDCA in Latency-Sensitive Wi-Fi 8 Networks

Wi-Fi 8 introduces Prioritized EDCA (P-EDCA) to support latency-critical traffic within which DS-RTS/CTS operates as a two-phase channel access procedure. In this mechanism, stations first compete in a Defer Signal (DS) contention, which determines the number of stations entering RTS/CTS contention, creating a stochastic coupling not captured by existing IEEE 802.11 models. We develop an analytical framework for the performance analysis of DS-RTS/CTS using a 2-D Markov chain to model the RTS backoff process of a tagged station under a variable number of contenders. Using this model, we obtain expressions for head-of-line delay and normalized throughput. We further formulate an optimization problem for adaptive selection of the DS contention window size. Results show that a moderately sized DS contention window achieves a favorable throughput-delay trade-off across network densities.

Mahith Chintada, Sreelakshmi Manjunath · 0 citations
Book Open access Jul 2026

Small Packets, Big Difference: L4S Congestion Control at Low Bandwidth

TCP Prague is a congestion control algorithm (CCA) for the low latency, low loss and scalable throughput (L4S) architecture, which targets very low queuing delay by leveraging fine-grained explicit congestion notification (ECN) signals. Most prior evaluations of Prague focus on high-rate scenarios and its TCP-friendliness. Prague can also, however, cope with low-bandwidth bottlenecks or compete with elastic and inelastic flows—leaving only a small fair share per flow. In such cases, Prague reduces its segment size to maintain approximately two packets per virtual round trip time (RTT). The current design derives the segment size from both the pacing rate and RTT, making it sensitive to noisy RTT conditions and potentially degrading performance. We redesign segment sizing to depend solely on the pacing_rate using three schemes—linear, exponential, and logarithmic. We implement these schemes in a modified Prague kernel and evaluate them in our testbed against both the default Prague segment-sizing algorithm and a fixed-segment-size baseline. On throttled links, our schemes reduce retransmissions by more than a factor of 20 and increase feedback granularity. Under both elastic (inter- and intra-CCA) and inelastic competition, they improve throughput stability and fairness.

Danesh Zeynali, Balakrishnan Chandrasekaran, Chia-Yu Chang et al. · 0 citations
Open access Jul 2026

A COMPREHENSIVE PERFORMANCE ANALYSIS OF WLAN PROTOCOLS USING THE NS-2 NETWORK SIMULATOR

Objective: This project focuses on simulating a Wireless Local Area Network (WLAN) using NS-2, specifically targeting a peer-to-peer (Ad-hoc) network. Method: By utilising an Independent Basic Service Set (IBSS), we enabled wireless devices to communicate directly with one another without relying on a central access point or base station. A network bridge was also integrated to connect the WLAN to external networks. Our approach began with a thorough examination of wireless simulation types and the key factors that influence network performance. From there, we mapped out a topology modelled after a university campus, strategically spacing out wireless nodes and adjusting their transmission power to ensure full coverage. To evaluate efficiency, we measured key performance metrics—including packet delivery ratio, delay, jitter, and throughput—and analysed how they scaled with traffic volume. Finally, we deployed and compared three routing protocols (AODV, DSR, and DSDV) to find the most efficient fit. Results: Ultimately, this allowed us to design a highly optimised, resource-efficient network layout that maximises performance without wasting bandwidth. Novelty: This project compares the performance of AODV, DSR, and DSDV routing protocols within an IBSS-based WLAN simulation to identify the most efficient protocol for a university campus network topology.

Maab Alaa · 0 citations
Open access 2026

Performance Analysis for Random Network Access Delay of Single Hop Ad Hoc Network Under Saturation Conditions

For military wireless communications, the MIL-STD-188-220 standard utilizes various Network Access Delay (NAD) mechanisms to efficiently allocate transmission slots within a shared medium. Among these, the random NAD (R-NAD) protocol is widely adopted for dynamic traffic environments. To evaluate the fundamental capacity and performance limits of single-hop ad hoc networks where all nodes operate within a direct radio range, a rigorous analysis under saturation conditions is essential. Despite its critical importance, a comprehensive theoretical framework that analyzes R-NAD performance under saturation and determines the maximum number of retransmissions required to guarantee specific packet delivery targets has been lacking. To address this issue, this paper provides a thorough performance analysis of the R-NAD protocol under saturation conditions, deriving key metrics such as transmission rate, loss probability, and average delay. Based on these analytical results, we propose a practical and simplified formula for determining the minimum value of the maximum retransmission count required to satisfy a specific target loss probability. Extensive simulations demonstrate that our theoretical derivations are exceptionally well-matched with simulation data. Furthermore, we show that selecting the precise maximum number of retransmissions that meets the target loss probability effectively prevents unnecessary average delay while strictly satisfying the network’s loss requirements, thereby providing a practical guideline for effective system configuration.

Hyungkook Oh, J. Park · 0 citations
Open access 2026

Churn-Aware Spectrum Admission in Low-Latency Mobile Networks

Spectrum admission in low-latency mobile networks increasingly relies on fast control loops under time-varying traffic and radio conditions. A key challenge in such settings is reconfiguration churn: small score fluctuations near the admission boundary can repeatedly flip the marginal admitted request, even when the resulting utility gain is negligible. These boundary-level replacements are disproportionately expensive because admission and eviction trigger higher-layer control procedures, signaling exchanges, and coordination overhead. To address this problem, we propose TOA-S, a churn-aware admission primitive for latency-bounded mobile control. TOA-S targets cellular radio access network (RAN) deployments operating over licensed spectrum, where control loops of the ultra-reliable low-latency communication class at the near-real-time RAN Intelligent Controller must complete within sub-second decision windows. TOA-S preserves the greedy allocation structure for the responsive core of the admitted set and applies stabilization only at the admission boundary, in a single pass per decision epoch, without iterative optimization or learning. We show that TOA-S incurs only an $\varepsilon $ -bounded utility deviation, modifies at most one membership decision per epoch, and suppresses oscillatory replacements under persistent boundary near-tie conditions. Simulations on synthetic workloads with measurement-verified parameters show that TOA-S substantially reduces reconfiguration churn while maintaining spectrum utilization and latency-compatible execution.

Chi-Jen Wu · 0 citations