This paper proposes a martingale extension of effective-capacity, a concept which has been instrumental in teletraffic theory to model the link-layer wireless channel and analyze QoS metrics. Together with a recently developed concept of an arrival-martingale, the proposed service-martingale concept enables the queueing analysis of a bursty source sharing a MAC channel. In particular, the paper derives the first rigorous and accurate stochastic delay bounds for a Markovian source sharing either an Aloha or CSMA/CA channel, and further considers two extended scenarios accounting for 1) in-source scheduling and 2) spatial multiplexing MIMO. By leveraging the powerful martingale methodology, the obtained bounds are remarkably tight...
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based ra...
Summarization: We consider the random multiple access of a slotted broadcast communication channel. ...
Motivated by an application in wireless random-access networks, we study a class of polling systems ...
Abstract—This paper proposes a martingale extension of effective-capacity, a concept which has been ...
We explore the achievable delay performance in wireless random-access networks. While relatively sim...
This paper proposes a new characterization of queueing systems by bounding a suitable exponential tr...
We explore the spatio-temporal congestion dynamics of wireless networks with backlog-based random-ac...
The practicality of the stochastic network calculus (SNC) is often questioned on grounds of loosenes...
A general model is presented for synchronous protocols that resolve conflicts among message transmis...
We examine the impact of torpid mixing and meta-stability issues on the delay performance in wireles...
Abstract—This paper presents a new approach to provide stochastic delay guarantees via fully distrib...
It has been recently shown that queue-based carrier sense multiple access (CSMA) algorithms are thro...
This thesis introduces mechanisms for support of real-time applications in high-density random-acces...
In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-nod...
We explore the achievable delay performance in wireless random-access networks. While relatively sim...
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based ra...
Summarization: We consider the random multiple access of a slotted broadcast communication channel. ...
Motivated by an application in wireless random-access networks, we study a class of polling systems ...
Abstract—This paper proposes a martingale extension of effective-capacity, a concept which has been ...
We explore the achievable delay performance in wireless random-access networks. While relatively sim...
This paper proposes a new characterization of queueing systems by bounding a suitable exponential tr...
We explore the spatio-temporal congestion dynamics of wireless networks with backlog-based random-ac...
The practicality of the stochastic network calculus (SNC) is often questioned on grounds of loosenes...
A general model is presented for synchronous protocols that resolve conflicts among message transmis...
We examine the impact of torpid mixing and meta-stability issues on the delay performance in wireles...
Abstract—This paper presents a new approach to provide stochastic delay guarantees via fully distrib...
It has been recently shown that queue-based carrier sense multiple access (CSMA) algorithms are thro...
This thesis introduces mechanisms for support of real-time applications in high-density random-acces...
In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-nod...
We explore the achievable delay performance in wireless random-access networks. While relatively sim...
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based ra...
Summarization: We consider the random multiple access of a slotted broadcast communication channel. ...
Motivated by an application in wireless random-access networks, we study a class of polling systems ...