Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
A Hard-Core Model on a Cayley Tree: An Example of a Loss Network
Queueing Systems: Theory and Applications
The Erlang model with non-poisson call arrivals
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
Queueing Systems: Theory and Applications
On the fairness of large CSMA networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
IEEE Transactions on Mobile Computing
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
The stability region of the finite-user slotted ALOHA protocol
IEEE Transactions on Information Theory
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies
IEEE Journal on Selected Areas in Communications
Extra back-off flow control in multi-hop wireless networks
Performance Evaluation
Tandem queueing networks with neighbor blocking and back-offs
Queueing Systems: Theory and Applications
Achieving target throughputs in random-access networks
Performance Evaluation
Performance of CSMA in multi-channel wireless networks
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years, fairly tractable models have been shown to yield remarkably accurate throughput estimates for CSMA networks. These models typically assume that both the transmission durations and the back-off periods are exponentially distributed. We show that the stationary distribution of the system is in fact insensitive with respect to the transmission durations and the back-off times. These models primarily pertain to a saturated scenario where nodes always have packets to transmit. In reality however, the buffers may occasionally be empty as packets are randomly generated and transmitted over time. The resulting interplay between the activity states and the buffer contents gives rise to quite complicated queueing dynamics, and even establishing the stability criteria is usually a serious challenge. We explicitly identify the stability conditions in a few relevant scenarios, and illustrate the difficulties arising in other cases.