A queuing-theoretic framework for delay optimization in multipath routing for MANETs

Centrality-Based Deployment of Queue Policies in Acyclic Multipath Routing Networks

Excessive queueing delays constitute a significant impediment to latency-sensitive network applications. Although effective deployment of Active Queue Management (AQM) strategies has been proposed as a necessary solution, deployment remains sparse. This paper studies AQM deployment in a specific class of networks where routers/switches have a topological hierarchy, form acyclic paths, and adopt multipath routing. Our approach rests on the well-established premise that AQM deployment impacts packet-forwarding dynamics in networks carrying TCP flows, thus establishing a direct link between stability and network performance. We use fluid models for TCP and queue dynamics in the network, along with a simple threshold-based queue policy to outline a closed-loop model for the network. Stability analyses reveal that while the network is vulnerable to instability as the average round-trip time (RTT) of the TCP flows increases, it tolerates a much larger RTT without losing stability when the threshold-based AQM is deployed in an appropriate router. We then define a Katz centrality-based metric to choose the most appropriate router for AQM deployment, and argue that doing so ensures the greatest stabilising effect. Finally, packet-level simulations corroborate that the proposed deployment strategy ensures low-latency operation of the network.

A Delay-Aware Congestion Control and Flow Aggregation Method for Improving Performance of FANET

A new Enhanced Intelligent-based Energy and Mobility, and Obstacle-aware Clustering (EIEMOC) protocol to control the network congestion while meeting End-to-End Delay (E2D) constraints in delay-constrained FANET applications.

MARS: Multipath Adaptive Reliable Service

Multipath transport is increasingly important for Internet/WAN services that move large data volumes across heterogeneous paths, including geo-distributed analytics, content distribution, and cloud-service pipelines. Existing solutions, however, face a practical trade-off: end-to-end transports such as MPTCP and MPQUIC are deployable but limited by endpoint-visible paths and delayed congestion feedback, while routing-or forwarder-assisted approaches often require infrastructure support or lack safe coordination across forwarding choices. This paper presents MARS, a receiver-driven, forwarder-assisted multipath transport for Internet/WAN environments. MARS combines tier-synchronized overlay path discovery with coupled consumer/forwarder congestion control, enabling it to safely expand usable forwarding opportunities and react near bottlenecks. It runs as an incrementally deployable UDP overlay at clients, servers, relays, or CDN-like nodes. We implement MARS in simulation and as a prototype, and evaluate it through large-scale simulation and Mininet emulation under different deployment scales, loss rates, and failure scenarios. The results show that MARS provides deployment-dependent benefits: with endpoint-only deployment, it remains competitive with end-to-end multipath baselines; with cooperating overlay forwarders, it exposes richer usable path diversity and reduces max p95 flow completion time by up to 81.5\% over ECMP-limited baselines. Even against path-expanded end-to-end baselines given the same path set, MARS achieves lower worst-case p95 FCT and stronger robustness under packet loss, while also recovering quickly from transient link failures. These results demonstrate that ICN-style receiver-driven forwarding can serve as a deployable overlay transport substrate for WAN multipath, providing benefits beyond purely end-to-end designs without requiring changes to IP routing.

Design and Analysis of a Rate-based Protocol for Communication Networks

Traffic-Adaptive Per-Hop Multipath Routing in Multi-Hop UAV Networks

This work develops a multi-agent reinforcement learning (MARL) algorithm, termed Multi-Agent Proximal Policy Optimization with Dirichlet Modeling (MAPPO-DM), which follows the centralized-training-and-decentralized-execution framework and models continuous traffic-splitting actions using a Dirichlet distribution.

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.