Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1103.2212

Stability and Queueing Analysis of IEEE 802.11 Distributed Coordination Function

Dongjie Yin·Pui King Wong·Tony T. Lee
View original source ↗Read source document ↗Export metadata ↓

Abstract

A widely adopted two-dimensional Markov chain model of the IEEE 802.11 DCF was introduced by Bianchi to characterize the backoff behavior of a single node under a saturated traffic condition. Using this approach, we propose a queuing model for the 802.11 DCF under a non-saturated traffic environment. The input buffer of each node is modeled as a Geo/G/1 queue, and the packet service time distribution is derived from Markov state space of 802.11 DCF with the underlying scheduling algorithm. The DCF defines two access mechanisms, namely the Basic access mechanism and the request-to-send/clear-to-send (RTS/CTS) access mechanism. Based on our model, performance analyses of both schemes are studied with probabilistic exponential backoff scheduling. We obtain the characteristic equation of network throughput and expressions of packet queueing delay. Specifically, we obtain the stable throughput and bounded delay regions with respect to the retransmission factor according to the basic queueing analysis. For both access schemes, the bounded delay region is a subset of the stable throughput region. Our results show that the RTS/CTS access mechanism is more stable and performs better than the Basic access mechanism. The analysis in this paper is verified by simulation results.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongjie Yin, Pui King Wong, Tony T. Lee. 2012-01-11. Stability and Queueing Analysis of IEEE 802.11 Distributed Coordination Function. https://arxiv.org/abs/1103.2212

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

KEEP EXPLORING

Related papers

arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗
arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗
arXiv2026

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI↗