Delay analysis for maximal scheduling in wireless networks with bursty traffic

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 385-393

  Neely, Michael J ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Markov chains; Queueing analysis

Indexed keywords

COMPUTER COMMUNICATIONS; INFOCOM; MARKOV CHAINS; QUEUEING ANALYSIS;

COMPUTER NETWORKS;

EID: 50649084845     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.10     Document Type: Conference Paper

References (17)

1. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. Proc. of 43rd Annual Allerton Conf. on Communication Control and Computing, September 2005.
2. X. Wu, R. Srikant, and J. R. Perkins. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. IEEE Transactions on Mobile Computing, June 2007.
3. X. Lin and N. B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. Proc. IEEE INFOCOM, 2005.
4. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transacations on Automatic Control, vol. 37, no. 12, pp. 1936-1949, Dec. 1992.
5. L. Georgiadis, M. J. Neely, and L. Tassiulas. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, vol. 1, no. 1, pp. 1-149, 2006.
6. D. Shah. Maximal matching scheduling is good enough. Proc. IEEE Globecom. Dec. 2003.
7. S. Deb, D. Shah, and S. Shakkottai. Fast matching algorithms for repetitive optimization: An application to switch scheduling. Proc. of 40th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, March 2006.
8. J. G. Dai and B. Prabhakar. The throughput of data switches with and without speedup. Proc. IEEE INFOCOM, 2000.
9. A. Mekkittikul and N. McKeown. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. Proc. IEEE INFOCOM, 1998.
10. M. J. Neely. Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks. Proc. of Allerton Conf. on Communication, Control, and Computing (invited paper), Sept. 2006.
11. M. J. Neely, E. Modiano, and C. E Rohrs. Dynamic power allocation and routing for time varying wireless networks. IEEE Journal on Selected Areas in Communications, vol. 23, no. 1, pp. 89-103, January 2005.
12. M. J. Neely, E. Modiano, and Y-S. Cheng. Logarithmic delay for n × n packet switches under the crossbar constraint. IEEE Tmnsactions on Networking, vol. 15, no. 3. pp. 657-668, June 2007.
13. S. Shakkottai, R. Srikant, and A. Stolyar. Pathwise optimality of the exponential scheduling rule for wireless channels. Advances in Applied Probability, vol. 36, no. 4, pp. 1021-1045, Dec. 2004.
14. E. Leonardi, M. Mellia, F. Neri, and M. Ajmone Marsan. Bounds on average delays and queue size averages and variances in input-queued cell-based switches. Proc. IEEE INFOCOM, 2001.
15. M. J. Neely, E. Modiano, and C. E. Rohrs. Power allocation and routing in multi-beam satellites with time varying channels. IEEE Transactions on Networking, vol. 11, no. 1 pp. 138-152. Feb. 2003.
16. S. Ross. Stochastic Processes. John Wiley & Sons. Inc., New York, 1996.
17. M. J. Neely. Energy optimal control for time varying wireless networks. IEEE Transactions on Information Theory, vol. 52. no. 7, July 2006.