Queue-based Random-access Algorithms: Fluid Limits and Stability Issues

References

• Billingsley, P. (1968). Weak Convergence of Probability Measures, Wiley–Interscience. MR0233396Google Scholar
• Billingsley, P. (1995). An Introduction to Probability and Measure, Wiley–Interscience, 3rd edition. MR1324786Google Scholar
• Boorstyn, R.R., Kershenbaum, A., Maglaris, B., Sahin, V. (1987). Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. Commun. 35, 267–274.Google Scholar
• Bouman, N., Borst, S.C., van Leeuwaarden, J.S.H., Proutière, A. (2011). Backlog-based random access in wireless networks: fluid limits and delay issues. In: Proc. ITC 23 Conf., 39–46.Google Scholar
• Dai, J.G. (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Prob. 5, 49–77. MR1325041Google Scholar
• Dai, J.G. (1996). A fluid limit model criterion for instability of multiclass queueing networks. Ann. Appl. Prob. 6, 751–757. MR1410113Google Scholar
• Dai, J.G., Meyn, S.P. (1995). Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Aut. Control 40(11), 1889–1904. MR1358006Google Scholar
• Durvy, M., Dousse, O., Thiran, P. (2007). Modeling the 802.11 protocol under different capture and sensing capabilities. In: Proc. Infocom 2007 Conf.Google Scholar
• Durvy, M., Thiran, P. (2006). A packing approach to compare slotted and non-slotted medium access control. In: Proc. Infocom 2006 Conf.Google Scholar
• Ethier, N., Kurtz, T.G. (1985). Markov Processes: Characterization and Convergence, Wiley–Interscience. MR0838085Google Scholar
• Feller, W. (1970). An Introduction to Probability Theory and Its Applications, Vol. 2, John Wiley and Sons.Google Scholar
• Feuillet, M., Proutière, A., Robert, Ph. (2010). Random capture algorithms: fluid limits and stability. In: Proc. ITA Workshop.Google Scholar
• Foss, S.G., Kovalevskii, A.P. (1999). A stability criterion via fluid limits and its application to a polling model. Queueing Systems 32, 131–168. MR1720552Google Scholar
• Ghaderi, J., Srikant, R. (2010). On the design of efficient CSMA algorithms for wireless networks. In: Proc. CDC 2010 Conf.Google Scholar
• Ghaderi, J., Srikant, R. (2012). The impact of access probabilities on the delay performance of Q-CSMA algorithms in wireless networks. IEEE/ACM Trans. Netw., to appear.Google Scholar
• Jiang, L., Leconte, M., Ni, J., Srikant, R., Walrand, J. (2011). Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling. In: Proc. Infocom 2010 Mini-Conf. MR2982678Google Scholar
• Jiang, L., Shah, D., Shin, J., Walrand, J. (2010). Distributed random access algorithm: scheduling and congestion control. IEEE Trans. Inf. Theory 56(12), 6182–6207. MR2809994Google Scholar
• Jiang, L., Walrand, J. (2008). A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In: Proc. Allerton 2008 Conf.Google Scholar
• Jiang, L., Walrand, J. (2010). A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Trans. Netw. 18(3), 960–972.Google Scholar
• Kovalevskii, A.P., Topchii, V.A., Foss, S.G. (2005). On the stability of a queueing system with uncountable branching fluid limits. Prob. Inf. Trans. 41(3), 254–279. MR2163853Google Scholar
• Lee, C.-H., Eun, D.Y., Yun, S.-Y., Yi, Y. (2012). From Glauber dynamics to Metropolis algorithm: smaller delay in optimal CSMA. In: Proc. ISIT 2012 Conf.Google Scholar
• Liew, S.C., Kai, C.H., Leung, J., Wong, B. (2010). Back-of-the-envelope computation of throughput distributions in CSMA wireless networks. IEEE Trans. Mob. Comp. 9(9), 1319–1331.Google Scholar
• Liu, J., Yi, Y., Proutière, A., Chiang, M., Poor, H.V. (2008). Towards utility-optimal random access without message passing. Wireless Commun. Mobile Comput. 10(1), 115–128.Google Scholar
• Lotfinezhad, M., Marbach, P. (2011). Throughput-optimal random access with order-optimal delay. In: Proc. Infocom 2011 Conf.Google Scholar
• Marbach, P., Eryilmaz, A. (2008). A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks. In: Proc. Allerton 2008 Conf.Google Scholar
• Meyn, S.P. (1995). Transience of multiclass queueing networks via fluid limit models. Ann. Appl. Prob. 5, 946–957. MR1384361Google Scholar
• Ni, J., Tan, B., Srikant, R. (2010). Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In: Proc. Infocom 2010 Mini-Conf.Google Scholar
• Rajagopalan, S., Shah, D., Shin, J. (2009). Network adiabatic theorem: an efficient randomized protocol for content resolution. In: Proc. ACM SIGMETRICS/Performance 2009 Conf.Google Scholar
• Remerova, M., Foss, S.G., Zwart, B. (2014). Random fluid limit of an overloaded polling model. Advances in Applied Probability 46(1), 76–101.Google Scholar
• Robert, Ph., Véber, A. (2012). On the fluid limits of a resource sharing algorithm with logarithmic weights. arXiv:1211.5968v1.Google Scholar
• Rogers, L.C.G., Williams, D. (1989). Diffusions, Markov Processes and Martingales, Vol. II, Wiley, London.Google Scholar
• Royden, H.L. (1987). Real Analysis, Prentice Hall, 3rd edition. MR1013117Google Scholar
• Shah, D., Shin, J. (2010). Delay-optimal queue-based CSMA. In: Proc. ACM SIGMETRICS 2010 Conf.Google Scholar
• Shah, D., Shin, J. (2012). Randomized scheduling algorithms for queueing networks. Ann. Appl. Prob. 22(1), 128–171. MR2932544Google Scholar
• Shah, D., Shin, J., Tetali, P. (2010). Medium access using queues. In: Proc. FOCS 2011 Conf. MR2933306Google Scholar
• Shah, D., Tse, D.N.C., Tsitsiklis, J.N. (2011). Hardness of low delay network scheduling. IEEE Trans. Inf. Theory 57(12), 7810–7817. MR2895362Google Scholar
• Subramanian, V., Alanyali, M. (2011). Delay performance of CSMA in networks with bounded degree conflict graphs. In: Proc. ISIT 2011 Conf.Google Scholar
• Tassiulas, L., Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Aut. Contr. 37, 1936–1948. MR1200609Google Scholar
• Wang, X., Kar, K. (2005). Throughput modeling and fairness issues in CSMA/CA based ad-hoc networks. In: Proc. Infocom 2005 Conf.Google Scholar
• Whitt, W. (1969). Weak convergence of probability measures on the function space C[0, ∞). Technical Report No. 120, Stanford University. MR0261646Google Scholar
• Whitt, W. (1970). Weak convergence of probability measures on the function space C[0, ∞). Ann. Math. Statistics 41(3), 939–944. MR0261646Google Scholar
• Williams, D. (1991). Probability with Martingales, Cambridge University Press. MR1155402Google Scholar