Random-access networks

Quantifying throughput and delay performance of wireless networks protocols using Markov chains and heavy-traffic limits.

See below for the list of related publications and preprints.

Applied Probability Statistical Physics Large Deviations Graph Theory
Alessandro Zocca
Alessandro Zocca
Tenured Assistant Professor

Related

Publications

Temporal starvation in multi-channel CSMA networks: An analytical framework (2019)

A. Zocca Queueing Systems
Seeking an optimal trade-off between throughput and delays in multi-channel (CSMA) random-access networks
arXiv preprint PDF DOI bib

On the Interactions Between Multiple Overlapping WLANs Using Channel Bonding (2016)

B. Bellalta, A. Zocca, A. Checco, J. Barcelo IEEE Transactions on Vehicular Technology
How to improve the performance of multi-channel CSMA algorithm with channel bonding?
arXiv preprint PDF DOI bib

Spatio-temporal dynamics of random-access networks: An interacting particle approach (PhD thesis) (2015)

A. Zocca PhD thesis
How to use interacting particle systems to describe and predict the performance of wireless networks?
PDF TU/e repository bib

Slow Transitions and Starvation in Dense Random-Access Networks (2015)

A. Zocca, S.C. Borst, J.S.H. van Leeuwaarden Stochastic Models
How do CSMA-like algorithms behave on partite interference graphs in the heavy-traffic limit?
arXiv preprint PDF DOI bib

Throughput analysis in CSMA/CA networks using continuous time Markov networks: A tutorial (2014)

B. Bellalta, A. Zocca, C. Cano, A. Checco, J. Barcelo, A. Vinel Book chapter
How to model and characterize the performance of advanced wireless protocols using Markov processes?
arXiv preprint PDF DOI bib

Delay performance in random-access grid networks (2013)

A. Zocca, S.C. Borst, J.S.H. van Leeuwaarden, F.R. Nardi Performance Evaluation
How does temporal starvation in wireless networks scale with the network size?
arXiv preprint PDF DOI bib

Mixing properties of CSMA networks on partite graphs (2012)

A. Zocca, S.C. Borst, J.S.H. van Leeuwaarden VALUETOOLS 2012
How well do CMSA-like algorithms perform on complete bipartite graphs?
arXiv preprint PDF DOI bib