A high-order Markov chain based scheduling algorithm for low delay in CSMA networks

[1]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[2]  Nick G. Duffield,et al.  Exponential bounds for queues with Markovian arrivals , 1994, Queueing Syst. Theory Appl..

[3]  R. Srikant,et al.  Effect of access probabilities on the delay performance of Q-CSMA algorithms , 2012, 2012 Proceedings IEEE INFOCOM.

[4]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[5]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[6]  E. Modiano,et al.  Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning , 2008, IEEE/ACM Transactions on Networking.

[7]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[8]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[9]  Murat Alanyali,et al.  Delay performance of CSMA in networks with bounded degree conflict graphs , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[10]  Minghua Chen,et al.  Mixing time and temporal starvation of general CSMA networks with multiple frequency agility , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

[12]  Ness B. Shroff,et al.  Use of the supremum distribution of Gaussian Processes in queueing analysis with long-range Dependence and self-similarity , 2000 .

[13]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[14]  Xiaojun Lin,et al.  Improving the delay performance of CSMA algorithms: A Virtual Multi-Channel approach , 2013, 2013 Proceedings IEEE INFOCOM.

[15]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[16]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[17]  Alexander L. Stolyar,et al.  Convexity properties of loss and overflow functions , 2003, Oper. Res. Lett..

[18]  Nick G. Duffield,et al.  Large deviations, the shape of the loss curve, and economies of scale in large multiplexers , 1995, Queueing Syst. Theory Appl..

[19]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[20]  S. Meyn,et al.  Stability of Markovian processes I: criteria for discrete-time Chains , 1992, Advances in Applied Probability.

[21]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[22]  Jian Ni,et al.  Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[23]  Yung Yi,et al.  From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[24]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[25]  Ness B. Shroff,et al.  A measurement-analytic approach for QoS estimation in a network based on the dominant time scale , 2003, TNET.

[26]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[27]  Nick Duffield,et al.  Large deviations and overflow probabilities for the general single-server queue, with applications , 1995 .

[28]  Zhen Liu,et al.  Smoothing effect of the superposition of homogeneous sources in tandem networks , 2000, Journal of Applied Probability.

[29]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[30]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[31]  Peter Marbach,et al.  Throughput-optimal random access with order-optimal delay , 2010, 2011 Proceedings IEEE INFOCOM.

[32]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[33]  Devavrat Shah,et al.  Delay optimal queue-based CSMA , 2010, SIGMETRICS '10.

[34]  Charles J. Geyer,et al.  Practical Markov Chain Monte Carlo , 1992 .