Random capture algorithms fluid limits and stability

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Information Theory and Applications Workshop

• Publication date

  2010-04-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ITA.2010.5454097
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

  2010cited by this paper
• Network adiabatic theorem: an efficient randomized protocol for contention resolution

  2009cited by this paper
• Distributed Random Access Algorithm: Scheduling and Congestion Control

  2009cited by this paper
• Distributed Random Access Algorithm: Scheduling and Congesion Control

  2009cited by this paper
• Distributed algorithm and reversible network

  2008cited by this paper
• Performance of random medium access control, an asymptotic approach

  2008cited by this paper
• Throughput of random access without message passing

  2008cited by this paper
• Maximizing throughput in wireless networks via gossiping

  2006cited by this paper
• Distributed Link Scheduling With Constant Overhead

  2006cited by this paper
• Maximum size matching is unstable for any packet switch

  2003cited by this paper
• Markov Models and Optimization

  1995cited by this paper
• On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models

  1995cited by this paper
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

  1990cited by this paper

• Fluid limits for QB-CSMA with polynomial rates, homogenization and reflection

  2024cites this paper
• Fluid limits for Queue-based CSMA with polynomial rates, homogenization and reflection

  2020cites this paper
• Fluid limits for the Queue-Based Carrier Sense Multiple Access algorithms with polynomial rates

  2020cites this paper
• Hybrid Scheduling in Heterogeneous Half- and Full-Duplex Wireless Networks

  2020cites this paper
• Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms

  2019cites this paper
• Hybrid Scheduling in Heterogeneous Half-and Full-Duplex Wireless Networks

  2018cites this paper
• Delay performance in random-access networks

  2014cites this paper
• M ay 2 01 3 Lingering Issues in Distributed Scheduling

  2013cites this paper
• Fundamental limits of random access in wireless networks

  2013cites this paper
• Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues

  2013influential citation
• Lingering issues in distributed scheduling

  2013cites this paper
• Delay Performance and Mixing Times in Random-Access Networks

  2013cites this paper
• Queuing behavior of queue-backlog-based random access scheduling in the many-channel regime

  2013cites this paper
• Delay-oriented analysis and design of optimal scheduling algorithms

  2013cites this paper
• Queue-based random access in wireless networks

  2013cites this paper
• Backlog-based random access in wireless networks: Fluid limits and instability issues

  2012influential citation
• RateOptimal scheduling schemes for asynchronous InputQueued packet switches

  2012cites this paper
• Backlog-based random access in wireless networks: Fluid limits and instability issues

  2012influential citation
• Backlog-based random access in wireless networks: Fluid limits and delay issues

  2011cites this paper
• Performance of CSMA in multi-channel wireless networks

  2010cites this paper