ACM Home Page
Please provide us with feedback. Feedback
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime
Full text PdfPdf (472 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems table of contents
Seattle, WA, USA
SESSION: Wireless networks table of contents
Pages 121-132  
Year of Publication: 2009
ISBN:978-1-60558-511-6
Authors
Shreeshankar Bodas  The University of Texas at Austin, Austin, TX, USA
Sanjay Shakkottai  The University of Texas at Austin, Austin, TX, USA
Lei Ying  Iowa State University, Ames, IA, USA
R. Srikant  University of Illinois at Urbana-Champaign, Urbana, IL, USA
Sponsors
ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 49,   Downloads (12 Months): 133,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1555349.1555364
What is a DOI?

ABSTRACT

We consider the problem of designing scheduling algorithms for the downlink of cellular wireless networks where bandwidth is partitioned into tens to hundreds of parallel channels, each of which can be allocated to a possibly different user in each time slot. We prove that a class of algorithms called Iterated Longest Queues First (iLQF) algorithms achieves the smallest buffer overflow probability in an appropriate large deviations sense. The class of iLQF algorithms is quite different from the class of max-weight policies which have been studied extensively in the literature, and it achieves much better performance in the regimes studied in this paper.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
3GPP TR 25.913. Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN). March 2006.
 
2
M. Andrews, K. Kumaran, K. Ramanan, A.L. Stolyar, R. Vijayakumar, and P. Whiting. CDMA data QoS scheduling on the forward link with variable channel conditions. Bell Labs Tech. Memo, April 2000.
 
3
S. Bodas, S. Shakkottai, L. Ying, and R. Srikant. Scheduling in multi-channel wireless networks: Rate function optimality in the small-buffer regime. Technical report, The University of Texas at Austin, WNCG, 2009.
 
4
A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer-Verlag New York, Inc., second edition, 1998.
 
5
 
6
WiMax Forum. Mobile WiMAX Part I: A technical overview and performance evaluation. March 2006. White Paper.
 
7
A. Ganti, E. Modiano, and J. Tsitsiklis. Optimal transmission scheduling in symmetric communication models with intermittent connectivity. IEEE Trans. Inform. Theory, 53:998--1008, March 2007.
 
8
S. Kittipiyakul and T. Javidi. Delay-Optimal Server Allocation in Multi-Queue Multi-Server Systems with Time-Varying Connectivities. Technical Report, UCSD, 2008.
 
9
Jon Kleinberg and Èva Tardos. Algorithm Design. Pearson Education, 2006.
 
10
S.P. Meyn. Stability and asymptotic optimality of generalized maxweight policies. SIAM J. Control and Optimization, 2008. to appear.
 
11
M.J. Neely. Delay Analysis for Max Weight Opportunistic Scheduling in Wireless Systems. In Forty-Sixth Annual Allerton Conference On Communication, Control, and Computing, Sep. 2008.
 
12
M.J. Neely, E. Modiano, and C.E. Rohrs. Power and server allocation in a multi-beam satellite with time varying channels. In Proc. IEEE Infocom, volume 3, pages 1451--1460, New York, NY, June 2002.
 
13
S. Shakkottai. Effective capacity and QoS for wireless scheduling. IEEE Trans. Automat. Contr., 53(3):749--761, February 2008.
 
14
S. Shakkottai, R. Srikant, and A. Stolyar. Pathwise optimality of the exponential scheduling rule for wireless channels. Ann. Appl. Prob., 36(4):1021--1045, December 2004.
 
15
S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Ann. Math. Statist., 207:185--202, 2002.
 
16
A. Stolyar. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Prob., 14(1), 2004.
 
17
 
18
L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Contr., 4:1936--1948, December 1992.
 
19
L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inform. Theory, 39:466--478, March 1993.
 
20
V.J. Venkataramanan and X. Lin. Structural properties of LDP for queue-length based wireless scheduling algorithms. In Proc. Ann. Allerton Conf. Communication, Control and Computing, Monticello, Illinois, September 2007.
 
21
L. Ying, R. Srikant, A. Eryilmaz, and G. Dullerud. A large deviations analysis of scheduling in wireless networks. IEEE Trans. Inform. Theory, 52(11):5088--5098, November 2006.

Collaborative Colleagues:
Shreeshankar Bodas: colleagues
Sanjay Shakkottai: colleagues
Lei Ying: colleagues
R. Srikant: colleagues