On the stability of flow-aware CSMA

@article{Bonald2010OnTS,
  title={On the stability of flow-aware CSMA},
  author={Thomas Bonald and Mathieu Feuillet},
  journal={Perform. Evaluation},
  year={2010},
  volume={67},
  pages={1219-1229}
}

Figures from this paper

On flow-aware CSMA in multi-channel wireless networks

  • T. BonaldM. Feuillet
  • Computer Science
    2011 45th Annual Conference on Information Sciences and Systems
  • 2011
TLDR
It is proved that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.

Performance of CSMA in multi-channel wireless networks

TLDR
It is proved that CSMA is optimal in the ad-hoc mode, when each flow goes through a unique dedicated wireless link from a transmitter to a receiver, and proposes a slight modification of CSMA that is referred to as flow-aware CSMA, which makes the algorithm optimal in all cases.

Opportunistic Routing with Adaptive CSMA/CA in Wireless Mesh Networks

  • M. KurthJ. Redlich
  • Computer Science, Business
    2010 IEEE Global Telecommunications Conference GLOBECOM 2010
  • 2010
TLDR
A cross-layer protocol that integrates opportunistic routing into a CSMA wireless mesh network, and a MAC model and protocol with enhanced spatial reuse that enables spatial efficient anycast transmissions with more realistic assumptions about the carrier sensing capabilities.

Scheduling in Wireless Networks with Connection Arrivals and Departures

TLDR
The MAC layer protocol can achieve throughput optimality independent of the window flow control protocol used, and this model shows that for an appropriately chosen MAC layer scheduling protocol, the network is stable for all file arrival rates within the capacity region.

Balancing Exposed and Hidden Nodes in Linear Wireless Networks

TLDR
It is shown that the sensing range that maximizes throughput critically depends on the activation rate of nodes, and the existence of a threshold is proved, which proves that the optimal sensing range is small to maximize spatial reuse and large to preclude all collisions.

Flow-Level Stability of Wireless Networks: Separation of Congestion Control and Packet Scheduling

TLDR
It is shown that stability can be ensured even with very simple congestion control mechanisms, such as a fixed window size scheme which limits the maximum number of packets that are allowed into the ingress queue of a flow.

Flow-Level Stability of Wireless Networks: Separation of Congestion Control and Scheduling

TLDR
It is shown that stability can be ensured even with very simple congestion control mechanisms, such as a fixed window size scheme which limits the maximum number of packets that are allowed into the ingress queue of a flow.

On the universality of age-based scheduling in wireless networks

TLDR
When some flows in the network are dynamic (i.e., they arrive and depart from the network and are not persistent), then HoL-age-based scheduling algorithms are throughput-optimal while it has previously been shown that queue-length-based algorithms are not.

Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems

TLDR
It is shown that the necessary condition $\lamba \beta <\mu$ is also su??fficient for random admissible-set scheduling to achieve stability, if feasible to do so at all, for a broad class of interference scenarios.

Stability of spatial wireless systems with random admissible-set scheduling

TLDR
It is shown that the necessary condition λβ < μ is also sufficient for random admissible-set scheduling to achieve stability, and randomAdmissible- set scheduling achieves stability, if feasible to do so at all, for a wide range of interference scenarios.

References

SHOWING 1-10 OF 23 REFERENCES

Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

TLDR
A discrete-time distributed randomized CSMA algorithm based on a generalization of the so-called Glauber dynamics from statistical physics, which generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption.

Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

  • Xinzhou WuR. SrikantJ. Perkins
  • Computer Science, Business
    Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
  • 2006
TLDR
This work proves a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all of the traffic only uses one hop of the network and proves that the lower bound is tight in the sense that, for any fraction larger than the lowerbound, it can find a topology and an arrival rate vector within the fraction of the capacity region such that the network is unstable under a greedy scheduling policy.

Impact of fairness on Internet performance

TLDR
It is proved that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one.

Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

TLDR
New bounds on the throughput efficiency of Greedy Maximal Scheduling for wireless networks of arbitrary topology under the general k-hop interference model are derived and a simple proof is provided that GMS can be implemented using only local neighborhood information in networks of any size.

Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks

TLDR
A number of new analytic results characterizing the performance limits of greedy maximal scheduling are provided, including an equivalent characterization of the efficiency ratio of GMS through a topological property called the local-pooling factor of the network graph.

Maximizing throughput in wireless networks via gossiping

TLDR
This work presents the first distributed scheduling framework that guarantees maximum throughput, based on a combination of a distributed matching algorithm and an algorithm that compares and merges successive matching solutions.

Bandwidth sharing and admission control for elastic traffic

TLDR
This work considers the performance of a network like the Internet handling so‐called elastic traffic where the rate of flows adjusts to fill available bandwidth and finds that weighted sharing has limited impact on perceived quality of service and discrimination in favour of short documents leads to considerably better performance than fair sharing.

Insensitive Traffic Models for Communication Networks

  • T. Bonald
  • Computer Science
    Discret. Event Dyn. Syst.
  • 2007
We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the

Statistical bandwidth sharing: a study of congestion at flow level

TLDR
The statistics of the realized throughput of elastic document transfers are studied, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows.

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

TLDR
The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied.