Low delay scheduling in wireless network

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1396-1400

  Jung, Kyomin ^a   Shah, Devavrat ^a  

^a Architecture Machine Group

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; MESSAGE EXCHANGING; NETWORK TOPOLOGIES;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; CYBERNETICS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; INFORMATION THEORY; NUCLEAR PROPULSION; SCHEDULING; TECHNICAL PRESENTATIONS; THROUGHPUT; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 51649083249     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557418     Document Type: Conference Paper

References (20)

1. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," Submitted, available through csl uiuc.edu/rsrikant, 2006.
2. 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, pp. 1936-1948, 1992.
3. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proceedings of IEEE Infocom, 1996, pp. 296-302.
4. N. McKeown, "iSLIP: a scheduling algorithm for input-queued switches," IEEE Transaction on Networking, vol. 7, no. 2, pp. 188-201, 1999.
5. J. Dai and B. Prabhakar, "The throughput of switches with and without speed-up," in Proceedings of IEEE Infocom, 2000, pp. 556-564.
6. L. Trevisan, "Non-approximability results for optimization problems on bounded degree instances," in ACM STOC, 2001.
7. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," vol. 21, no. 4, 2003, pp. 546-559.
8. D. Shah, "Stable algorithms for input queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001.
9. D. Shah and D. J. Wischik, "Optimal scheduling algorithm for input queued switch," in IEEE INFOCOM, 2006.
10. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inf. Theory, vol. 34, 1988.
11. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in 43rd Allerton conference on Comm. Control and computing, 2005.
12. L. Chen, S. H. Low, M. Chang, and J. C. Doyle, "Optimal cross-layer congestion control, routing and scheduling design in ad-hoc wireless networks," in IEEE INFOCOM, 2006.
13. X. Lin and N. B. Shroff, "Impact of imperfect scheduling in wireless networks," in IEEE INFOCOM, 2005.
14. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless network via gossiping," in ACM SIGMETRICS/Performance, 2006.
15. G. Sharma, R. Mazumdar, and N. Shroff, "On the complexity of scheduling in wireless networks," in ACM Mobicom, 2006.
16. H. Hunt-III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, "Nc-approximation schemes for np- and pspace-hard problems for geometric graphs," J. Algorithms, vol. 26, no. 2, pp. 238-274, 1998.
17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.
18. K. Jung and D. Shah, "Low delay scheduling in wireless network," Preprint, available at http://web.mit.edu/devavrat/www/delay. pdf.
19. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. Jones and Barlett Publishers, 2003.
20. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in ACM PODC, 2006.