Performance Analysis of Contention Based Medium Access Control Protocols

Sharma, Gaurav; Ganesh, Ayalvadi; Key, Peter

doi:10.1109/infocom.2006.253

Cited by 51 publications

(34 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also stress that the stability condition established in this work for the first time has been tantalizing other researchers as well, e.g., [17,Appendix B].…”

Section: Q:"under Which Conditions Is the Fpe Valid?"supporting

confidence: 60%

See 1 more Smart Citation

On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 mac protocol

Cho

Boudec

Jiang

2010

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

Abstract-Performance evaluation of the 802.11 MAC protocol is classically based on the decoupling assumption, which hypothesizes that the backoff processes at different nodes are independent. A necessary condition for the validity of this approach is the existence and uniqueness of a solution to a fixed point equation. However, it was also recently pointed out that this condition is not sufficient; in contrast, a necessary and sufficient condition is a global stability property of the associated ordinary differential equation. Such a property was established only for a specific case, namely for a homogeneous system (all nodes have the same parameters) and when the number of backoff stages is either 1 or infinite and with other restrictive conditions. In this paper, we give a simple condition that establishes the validity of the decoupling assumption for the homogeneous case. We also discuss the heterogeneous and the differentiated service cases and show that the uniqueness condition is not sufficient; we exhibit one case where the fixed point equation has a unique solution but the decoupling assumption is not valid.Index Terms-Mean field theory, ordinary differential equation, fixed point equation.

show abstract

“…We also stress that the stability condition established in this work for the first time has been tantalizing other researchers as well, e.g., [17,Appendix B].…”

Section: Q:"under Which Conditions Is the Fpe Valid?"supporting

confidence: 60%

“…The need of a proof for finite K is stressed in [1, pp.833] due to its practical implication. In line with this, by appealing to a Lyapunov function, Sharma et al proved this for the case K = 1 where there are only two backoff stages [17,Lemma 3].…”

Section: Validation Of Decoupling Assumption: Ode Modelmentioning

confidence: 89%

On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 mac protocol

Cho

Boudec

Jiang

2010

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

show abstract

“…Our cross-layer WLAN models may be viewed as advancing the station-centric Markov chain analysis approach followed by Bianchi [5] whose surprisingly accurate performance predictions are only now being better understood [24]. Our results show that modular station-centric Markov modeling-even when the underlying Markov chains for ARF, DCF, and TCP are very different-can accurately capture WLAN performance in the presence of cross-layer interactions.…”

Section: B New Contributionmentioning

confidence: 77%

“…A multi-rate generalization of Bianchi's model has been considered in [32], albeit with the severe restriction that stations are assigned fixed data rates. An interesting technical advance is a Markov chain model over the state-space counting the number of stations in a backoff stage [24] that trades Bianchi's independence assumption with stochastic approximation using average (i.e., deterministic) dynamics. The results are relevant because they help explain why the independence assumption leads to accurate quantitative predictions, a hallmark of Bianchi's Markov chain model.…”

Section: Related Workmentioning

confidence: 99%

Analysis of Cross-Layer Interaction in Multirate 802.11 WLANs

Choi

Park

Kim

2009

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Recent works in empirical 802.11 wireless LAN performance evaluation have shown that cross-layer interactions in WLANs can be subtle, sometimes leading to unexpected results. Two such instances are: (i) significant throughput degradation resulting from automatic rate fallback (ARF) having difficulty distinguishing collision from channel noise, and (ii) scalable TCP over DCF performance that is able to mitigate the negative performance effect of ARF by curbing multiple access contention even when the number of stations is large. In this paper, we present a framework for analyzing complex crosslayer interactions in 802.11 WLANs, with the aim of providing effective tools for understanding and improving WLAN performance. We focus on cross-layer interactions between ARF, DCF, and TCP, where ARF adjusts coding at the physical layer, DCF mediates link layer multiple access control, and TCP performs end-to-end transport. We advance station-centric Markov chain models of ARF, ARF-DCF with and without RTS/CTS, and TCP over DCF that may be viewed as multi-protocol extensions of Bianchi's IEEE 802.11 model. We show that despite significant increase in complexity the analysis framework leads to tractable and accurate performance predictions. Our results complement empirical and simulation-based findings, demonstrating the versatility and efficacy of station-centric Markov chain analysis for capturing cross-layer WLAN dynamics.

show abstract

“…A wealth of applications to specific case studies can be found in the literature; for instance to MAC protocols [8,38], TCP protocols [1,2], peer-to-peer networks [36], caching algorithms [27] and load balancing strategies [21,22].…”

Section: Related Workmentioning

confidence: 99%

Blending randomness in closed queueing network models

Casale

Tribastone

Harrison

2014

Performance Evaluation

View full text Add to dashboard Cite

Random environments are stochastic models used to describe events occurring in the environment a system operates in. The goal is to describe events that affect performance and reliability such as breakdowns, repairs, or temporary degradations of resource capacities due to exogenous factors. Despite having been studied for decades, models that include both random environments and queueing networks remain difficult to analyse. To cope with this problem, we introduce the blending algorithm, a novel approximation for closed queueing network models in random environments. The algorithm seeks to obtain the stationary solution of the model by iteratively evaluating the dynamics of the system in between state changes of the environment. To make the approach scalable, the computation relies on a fluid approximation of the queueing network model. A validation study on 1,800 models shows that blending can save a significant amount of time compared to simulation, with an average accuracy that grows with the number of servers in each station. We also give an interpretation of this technique in terms of Laplace transforms and use this approach to determine convergence properties.

show abstract

Performance Analysis of Contention Based Medium Access Control Protocols

Cited by 51 publications

References 22 publications

On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 mac protocol

On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 mac protocol

Analysis of Cross-Layer Interaction in Multirate 802.11 WLANs

Blending randomness in closed queueing network models

Contact Info

Product

Resources

About