"Efficient Random Access in Wireless Networks"

It is been recently shown that, simple and inherently distributed, backlog-based access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling mechanisms.  The type of activation rules for which throughput optimality has been established, may however yield excessive queue lengths and delays. We explore the potential for more aggressive/persistent access schemes to improve the delay performance and retaining universal maximum-stability guarantees.