Scheduling and congestion control for wireless and processing networks

Synthesis Lectures on Communication Networks

Volumn 6, Issue , 2010, Pages 1-152

  Jiang, Libin ^a   Walrand, Jean ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

carrier sense multiple access; congestion control; convex optimization; Markov chain; scheduling; stochastic approximation; stochastic processing networks; wireless networks

Indexed keywords

CLASSICAL PROBLEMS; CONGESTION CONTROL; DISTRIBUTED SCHEDULING; GENERAL ANALYTICAL MODEL; MANUFACTURING NETWORKS; MARKOV CHAIN; MAXIMUM THROUGH-PUT; PACKET COLLISIONS; PROCESSING NETWORK; RESOURCE SHARING; SERVICE SYSTEMS; STOCHASTIC APPROXIMATIONS; STOCHASTIC PROCESSING NETWORKS; THROUGHPUT OPTIMALITY; TRANSPORT LAYERS;

ACCESS CONTROL; APPROXIMATION THEORY; CARRIER COMMUNICATION; CONVEX OPTIMIZATION; DISTRIBUTED COMPUTER SYSTEMS; MANUFACTURE; MARKOV PROCESSES; NETWORK LAYERS; OPTIMIZATION; QUEUEING NETWORKS; SCHEDULING ALGORITHMS; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; THROUGHPUT; WIRELESS NETWORKS;

CARRIER SENSE MULTIPLE ACCESS;

EID: 77956860569     PISSN: 19354185     EISSN: None     Source Type: Book Series    
DOI: 10.2200/S00270ED1V01Y201008CNT006     Document Type: Conference Paper

References (79)

1. R. Ahlswede, N. Cai, S. Li, and R.W. Yeung, "Network Information Flow," IEEE Transactions on Information Theory, vol.46, no.4, pp. 1204-1216, Jul. 2000. DOI: 10.1109/18.850663 65
2. S. Asmussen, Applied probability and queues, Springer Verlag, 2003. 4
3. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming. Massachusetts: Athena Scientific, 1996. 129
4. G. Bianchi, "Performance Analysis of the IEEE 802.11 Distributed Coordination Function," IEEE Journal on Selected Areas in Communications, vol.18, no.3, pp. 535-547, 2000. DOI: 10.1109/49.840210 75, 97
5. R.R.Boorstyn,A.Kershenbaum,B.Maglaris,and V.Sahin,"Throughput Analysis in Multihop CSMA Packet Radio Networks," IEEETransactions on Communications,vol.35, no.3,pp. 267-274, Mar. 1987. DOI: 10.1109/TCOM.1987. 1096769 24, 25, 97
6. C. Bordenave, D. McDonald, A. Proutiere, "Performance of random medium access control, an asymptotic approach," in Proceedings of the ACM Sigmetrics 2008, pp. 1-12. DOI: 10.1145/1375457.1375459 80
7. V. Borkar, "Stochastic Approximation: A Dynamical Systems Viewpoint," 2008. 83, 94, 95, 132
8. S. Boyd and L. Vandenberghe, "Convex Optimization", Cambridge University Press, 2004. 18, 26, 55, 93, 125, 128
9. Loc Bui, R. Srikant, and Alexander Stolyar, "Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing," in IEEE INFOCOM 2009 Mini-Conference.
10. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees in maximal scheduling in wireless networks," in the 43rd Annual Allerton Conference on Communication, Control and Computing, Sep. 2005. 57
11. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, "Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures," in Proceedings of the IEEE, vol.95, no.1, pp. 255-312, 2007. DOI: 10.1109/JPROC.2006.887322
12. J. G. Dai and W. Lin, "Maximum Pressure Policies in Stochastic Processing Networks," Operations Research, vol.53, no.2, pp. 197-218, Mar-Apr 2005. DOI: 10.1287/opre.1040.0170 99, 100, 111 (Pubitemid 40666154)
13. J. G. Dai and W. Lin, "Asymptotic Optimality of Maximum Pressure Policies in Stochastic Processing Networks," Annals of Applied Probability, vol.18, no.6, pp. 2239-2299, 2008. DOI: 10.1214/08-AAP522 99
14. P. Diaconis and D. Strook, "Geometric bounds for eigenvalues of Markov chains," Annals of Applied Probability, vol.1, no.1, pp. 36-61, Feb. 1991. DOI: 10.1214/aoap/1177005980
15. A. Dimakis and J. Walrand, "Sufficient Conditions for Stability of Longest-Queue-First Scheduling: Second-Order Properties Using Fluid Limits," Advances in Applied Probability, vol.38, no.2, pp. 505-521, 2006. DOI: 10.1239/aap/1151337082 57 (Pubitemid 44057301)
16. R. Durrett, Probability: Theory and Examples. Duxbury Press, 3rd edition, March 16, 2004. 41, 130
17. M. Durvy, O. Dousse, and P. Thiran, "Border Effects, Fairness, and Phase Transition in Large Wireless Networks", in IEEE INFOCOM 2008, Phoenix, Arizona, Apr. 2008. 24
18. M. Durvy and P. Thiran, "Packing Approach to Compare Slotted and Non-Slotted Medium Access Control," in IEEE INFOCOM 2006, Barcelona, Spain, Apr. 2006. DOI: 10.1109/INFOCOM.2006.251 58 (Pubitemid 351240436)
19. A. Eryilmaz, A. Ozdaglar and E. Modiano, "Polynomial Complexity Algorithms for Full Utilization of Multi-hop Wireless Networks," in IEEE INFOCOM 2007, Anchorage, Alaska, May 2007. DOI: 10.1109/INFCOM.2007.65 57 (Pubitemid 47334265)
20. A. Eryilmaz and R. Srikant, "Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control," in IEEE INFOCOM, Mar. 2005. DOI: 10.1109/INFCOM.2005.1498459 73
21. P. Gupta and A. L. Stolyar, "Optimal Throughput Allocation in General Random Access Networks," in Conference on Information Sciences and Systems, Princeton, NJ, Mar. 2006. DOI: 10.1109/CISS.2006.286657 73
22. B. Hajek, "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, vol.13, no.2, pp. 311-329, 1988. DOI: 10.1287/moor.13.2.311 29
23. J. M. Harrison, "Brownian Models of Open Processing Networks: Canonical Representation of Workload," Annals of Applied Probability, vol.10, no.1, pp. 75-103, 2000. DOI: 10.1214/aoap/1019737665 99
24. J. M. Harrison and R. J. Williams, "Workload Reduction of a Generalized Brow-nian Network," Annals of Applied Probability, vol.15, no.4, pp. 2255-2295, 2005. DOI: 10.1214/105051605000000458 99 (Pubitemid 43106155)
25. J.M.Harrison and R.J.Williams,"Workload Interpretation for Brownian Models of Stochastic Processing Networks," Mathematics of Operations Research, vol.32, pp. 808-820, 2007. DOI: 10.1287/moor.1070.0271 (Pubitemid 351159459)
26. T. Ho and H. Viswanathan, "Dynamic Algorithms for Multicast with Intra-Session Network Coding," submitted to IEEE Transactions on Information Theory. DOI: 10.1109/TIT.2008.2009809 65, 66, 67
27. S Hu, G Chen, X Wang, "On extending the Brunk-Prokhorov strong law of large numbers for martingale differences," Statistics and Probability Letters, 2008, Elsevier. DOI: 10.1016/j.spl.2008.06.017 46
28. L. Jiang and S. C. Liew, "Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks," IEEE Transactions on Mobile Computing, vol.7, no.1, pp. 34-49, Jan. 2008. DOI: 10.1109/TMC.2007.1070 76 (Pubitemid 350183931)
29. L.Jiang,D. Shah,J.Shin, and J.Walrand,"Distributed Random Access Algorithm: Scheduling and Congestion Control," accepted to IEEE Transactions on Information Theory. 23
30. L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," in the 46th Annual Allerton Conference on Communication, Control, and Computing, Sep. 23-26, 2008. DOI: 10.1109/ALLERTON.2008.4797741 29, 94, 97
31. L. Jiang and J. Walrand, "A Distributed Algorithm for Maximal Throughput and Optimal Fairness in Wireless Networks with a General Interference Model," EECS Technical Report, UC Berkeley, Apr. 2008. http://www.eecs.berkeley.edu/Pubs/TechRpts/2008/ EECS-2008-38.html 32
32. L. Jiang and J. Walrand, "A Novel Approach to Model and Control the Throughput of CSMA/CA Wireless Networks", Technical Report, UC Berkeley, Jan 2009. http://www. eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-8.html 75, 97
33. L. Jiang and J. Walrand, "Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput," Technical Report, UC Berkeley, Mar. 2009. http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009- 43.html DOI: 10.1109/CDC.2009.5400349 29, 42, 70
34. L. Jiang and J. Walrand, "Approaching throughput-optimality in a Distributed CSMA Algorithm with Contention Resolution," Technical Report, UC berkeley, Mar. 2009. http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS- 2009-37.html DOI: 10.1145/1540358.1540361 84, 96
35. L. Jiang and J. Walrand, "Approaching Throughput-Optimality in a Distributed CSMA Algorithm: Collisions and Stability," (invited), ACM Mobihoc'09 S3 Workshop, May 2009. DOI: 10.1145/1540358.1540361
36. L. Jiang and J. Walrand, "Stable and Utility-Maximizing Scheduling for Stochastic Processing Networks," in the 47th Annual Allerton Conference on Communication, Control, and Computing, 2009. DOI: 10.1109/ALLERTON.2009. 5394870 99
37. C. Joo, X. Lin, and N. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling AlgorithminMulti-HopWirelessNetworks," inIEEEINFOCOM2008,Phoenix, Arizona, Apr. 2008. DOI: 10.1109/INFOCOM.2008.165 57
38. F. P. Kelly, "Reversibility and Stochastic Networks," Wiley, 1979. 9, 10, 24
39. F. P. Kelly, "Loss networks," Ann. Appl. Prob., vol.1, no.3, 1991. DOI: 10.1214/aoap/1177005872 80
40. F. P. Kelly, "Charging and Rate Control for Elastic Traffic," European Transactions on Telecommunications, vol.8, pp. 33-37, 1997. DOI: 10.1002/ett.4460080106
41. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability," Journal of the Operational Research Society, vol.49, no.3, pp. 237-252, 1998. DOI: 10.2307/3010473 73
42. H. Kushner and G. Yin, "Stochastic approximation and recursive algorithms and applications," Springer-Verlag, New York, 2003. 132
43. M. Leconte, J. Ni, and R. Srikant, "Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks," in ACM MOBIHOC, May 2009. DOI: 10.1145/1530748.1530771 57
44. J. W. Lee, M. Chiang, and R. A. Calderbank, "Utility-Optimal Random-Access Control," IEEE Transactions on Wireless Communications, vol.6, no.7, pp. 2741-2751, Jul. 2007. DOI: 10.1109/TWC.2007.05991 73 (Pubitemid 47171484)
45. S. C. Liew, C. Kai, J. Leung, and B. Wong, "Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks," in IEEE ICC, 2009. DOI: 10.1109/TMC.2010.89 24, 25
46. X. Lin and N. Shroff, "The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks," in IEEE INFOCOM 2005, Miami, Florida, Mar. 2005. 73
47. X. Lin, N. B. Shroff, and R. Srikant, "A Tutorial on Cross-Layer Optimization in Wireless Networks," IEEE Journal on Selected Areas in Communications, vol.24, no.8, pp.1452-1463, Aug. 2006. DOI: 10.1109/JSAC.2006. 879351 61, 64
48. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. V. Poor, "Convergence and Tradeoff of Utility-Optimal CSMA," http://arxiv.org/abs/0902.1996 29, 94, 97
49. S. H. Low and D. E. Lapsley, "Optimization Flow Control, I: Basic Algorithm and Convergence," IEEE/ACM Transactions on Networking, vol.7, no.6, pp. 861-874, Dec. 1999. DOI: 10.1109/90.811451 73 (Pubitemid 30553383)
50. S. H. Low and P. P. Varaiya, "A New Approach to Service Provisioning in ATM Networks," IEEE Transactions on Networking, vol.1, no.5, pp. 549-553, Oct. 1993. DOI: 10.1109/90.251913
51. P. Marbach, A. Eryilmaz, and A. Ozdaglar, "Achievable Rate Region of CSMA Schedulers in Wireless Networks with Primary Interference Constraints," in IEEE Conference on Decision and Control, 2007. 58
52. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% Throughput in an Input-Queued Switch," IEEE Transactions on Communications, vol.47, no.8, pp. 1260-1267, Aug. 1999. DOI: 10.1109/26.780463 56 (Pubitemid 30507567)
53. S. Meyn, "Stability and asymptotic optimality of generalized MaxWeight policies," SIAM Journal on Control and Optimization, vol.47, no.6, 2009. DOI: 10.1137/06067746X
54. J. Mo and J. Walrand, "Fair End-to-End Window-Based Congestion Control," IEEE/ACM Transactions on Networking, vol.8, no.5, pp. 556-567, 2000. DOI: 10.1109/90.879343 73 (Pubitemid 32017921)
55. E. Modiano, D. Shah, and G. Zussman, "Maximizing Throughput in Wireless Networks via Gossiping," ACM SIGMETRICS Performance Evaluation Review, vol.34 , no.1, Jun. 2006. DOI: 10.1145/1140103.1140283 57 (Pubitemid 44619077)
56. M. J. Neely, E. Modiano, and C-P. Li, "Fairness and Optimal Stochastic Control for Heterogeneous Networks," in IEEE INFOCOM, Mar. 2005.DOI: 10.1109/TNET.2007.900405 73, 110, 114
57. M. J. Neely, E. Modiano, and C. P. Li, "Fairness and Optimal Stochastic Control for Heterogeneous Networks," IEEE/ACM Transactions on Networking, vol.16, no.2, pp. 396-409, Apr. 2008. DOI: 10.1109/TNET.2007.900405 61, 70, 71 (Pubitemid 351578226)
58. M. J. Neely and R. Urgaonkar, "Cross Layer Adaptive Control for Wireless Mesh Networks," Ad Hoc Networks (Elsevier), vol.5, no.6, pp. 719-743, Aug. 2007. DOI: 10.1016/j.adhoc.2007.01.004 (Pubitemid 46720269)
59. J. Ni and R. Srikant,"Distributed CSMA/CA Algorithms for Achieving Maximum Throughput in Wireless Networks," in Information Theory and Applications Workshop, Feb. 2009. DOI: 10.1109/ITA.2009.5044953 80, 97
60. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks," http://arxiv. org/pdf/0901.2333
61. A. Proutiere, Y. Yi, and M. Chiang, "Throughput of Random Access without Message Passing," in Conference on Information Sciences and Systems, Princeton, NJ, USA, Mar. 2008. DOI: 10.1109/CISS.2008.4558579 58
62. S. Rajagopalan and D. Shah, "Distributed Algorithm and Reversible Network", in Conference on Information Sciences and Systems, Princeton, NJ, USA, Mar. 2008. DOI: 10.1109/CISS.2008.4558577
63. H. Robbins and S. Monro, "A Stochastic Approximation Method," The Annals of Mathematical Statistics, vol.22, no.3, pp. 400-407, Sep. 1951. 131
64. S. Sanghavi, L. Bui, and R. Srikant, "Distributed Link Scheduling with Constant Overhead," in ACM SIGMETRICS, Jun. 2007. DOI: 10.1145/1269899.1254920 57 (Pubitemid 350158094)
65. C. E. Shannon, "A Mathematical Theory of Communication," Bell System Technical Journal, vol.27, pp. 379-423, 623-656, July, October, 1948. DOI: 10.1063/1.3067010 10
66. L. Tassiulas and A. Ephremides, "Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks," IEEE Transactions on Automatic Control, vol.37, no.12, pp. 1936-1948, Dec. 1992. DOI: 10.1109/9.182479 7, 56, 114, 118
67. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in IEEE INFOCOM, volume 2, pages 533-539, 1998. DOI: 10.1109/INFCOM.1998.665071 56
68. M. J. Wainwright and M. I. Jordan, "Graphical Models, Exponential Families, and Variational Inference," Foundations and Trends in Machine Learning, vol.1, no.1-2, pp. 1-305, 2008. DOI: 10.1561/2200000001 25, 26, 32
69. J. Walrand, "Entropy in Communication and Chemical Systems," in the first International Symposium on Applied Sciences in Biomedical and Communication Technologies (Isabel'08), Oct. 2008. DOI: 10.1109/ISABEL.2008. 4712620 10
70. J. Walrand. An Introduction to Queueing Networks. Prentice Hall, 1988. 99
71. X. Wang and K. Kar, "Throughput Modelling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks," in IEEE INFOCOM 2005, Miami, Florida, Mar. 2005. 24
72. A. Warrier, S. Ha, P. Wason and I. Rhee, "DiffQ: Differential Backlog Congestion Control for Wireless Multi-hop Networks," Technical Report, Dept. Computer Science, North Carolina State University, 2008. 63
73. L. M. Wein, " Optimal Control of a Two-Station Brownian Network," Mathematics of Operations Research, vol.15, no.2, , pp. 215-242, May 1990. DOI: 10.1287/moor.15.2.215 99
74. P. Whittle, "Systems in Stochastic Equilibrium," John Wiley & Sons, Inc., New York, NY, USA, 1986. 10, 32
75. R. J. Williams, "On Stochastic Processing Networks," Lecture Notes, 2006. http://math. ucsd.edu/~williams/talks/belz/belznotes06.pdf 99
76. X. Wu and R. Srikant, "Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks," in IEEE INFOCOM 2006, Barcelona, Spain, Apr. 2006. DOI: 10.1109/INFOCOM.2006.176 57 (Pubitemid 351240363)
77. Y. Xi and E. M. Yeh, "Throughput Optimal Distributed Control of Stochastic Wireless Networks," inInternational Symposium on Modeling and Optimization in Mobile,Ad Hoc,andWireless Networks (WiOpt), 2006. 64
78. J. Zhang, D. Zheng, and M. Chiang,"The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization," IEEE Transactions on Information Theory, vol.54, no.2, pp. 645-665, Feb. 2008. DOI: 10.1109/TIT.2007.913572 (Pubitemid 351314657)
79. G. Zussman, A. Brzezinski, and E. Modiano, "Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks," in IEEE INFOCOM 2008, Phoenix, Arizona, Apr. 2008. 57