Delay and effective throughput of wireless scheduling in heavy traffic regimes: Vacation model for complexity

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2009, Pages 55-64

  Yi, Yung ^a   Zhang, Junshan ^b   Chiang, Mung ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b ARIZONA STATE UNIVERSITY   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Complexity; Heavy traffic; Scheduling; Wireless networks

Indexed keywords

COMPLEXITY; COMPLEXITY LEVELS; DATA TRANSMISSION; DELAY ANALYSIS; DELAY PERFORMANCE; DIMENSIONALITY REDUCTION; DISTRIBUTED SCHEDULING; EFFECTIVE THROUGHPUT; ENGINEERING IMPLICATIONS; EXPONENTIAL COMPLEXITY; HEAVY TRAFFICS; RELATIVE LENGTH; STATE-SPACE COLLAPSE; TIME COMPLEXITY; TRAFFIC SCHEDULING; TWO-REGIME; VACATION PERIOD; WIDE SPECTRUM; WIRELESS SCHEDULING;

COMPUTER SCIENCE; DATA COMMUNICATION SYSTEMS; MESSAGE PASSING; MOBILE AD HOC NETWORKS; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS; TRANSMISSIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 70450186013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1530748.1530757     Document Type: Conference Paper

References (31)

1. E. Altman and H. J. Kushner. Control of polling in presence of vacations in heavy traffic with applications to satellite and mobile radio systems. SIAM Journal on Control and Optimization, 41:217-252, 2002.
2. M. Bramson. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst., 30(1-2):89-148, 1998.
3. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proceedings of Allerton, 2005.
4. H. Chen and W. Whitt. Diffusion approximations for open queueing networks with service interruptions. Queueing Systems, 13:335-359, 1993.
5. H. Chen and D. Yao. Fundamentals of Queueing Networks. Springer-Verlag, 2001.
6. J. G. Dai. On positive harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability, 5:49-77, 1995.
7. J. G. Dai and W. Lin. Asymptotic optimality of maximum pressure policies in stochastic processing networks. Annals of Applied Probability, 18(6):2239-2299, 2008.
8. A. Eryilmaz, A. Ozdaglar, and E. Modiano. Polynomial complexity algorithms for full utilization of multi-hop wireless networks. In Proceedings of IEEE Infocom, 2007.
9. G. R. Gupta and N. Shroff. Delay analysis of multi-hop wireless networks. In Proceedings of IEEE Infocom, 2009.
10. C. Joo and N. B. Shroff. Performance of random access scheduling schemes in multi-hop wireless networks. In Proceedings of IEEE Infocom, 2007.
11. K. Jung and D. Shah. Low delay scheduling in wireless network. In Proceeding of ISIT, 2007.
12. O. Kella and W. Whitt. Diffusion approximations for queues with server vacations. Advances in Applied Probability, 22:706-729, 1990.
13. X. Lin and S. Rasool. Constant-time distributed scheduling policies for ad hoc wireless networks. In Proceedings of IEEE CDC, 2006.
14. X. Lin and N. B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proceedings of IEEE Infocom, 2005.
15. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossiping. In Proceedings of ACM Sigmetrics, 2006.
16. M. J. Neely, E. Modiano, and C. E. Rohrs. Tradeoffs in delay guarantees and computation complexity for nxn packet switches. In Proceedings of CISS, 2002.
17. S. Ray and S. Sarkar. Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. In Proceedings of Information Theory and Applications Second Workshop, 2007.
18. S. Sanghavi, L. Bui, and R. Srikant. Distributed link scheduling with constant overhead. In Proceedings of ACM Sigmetrics, 2007.
19. D. Shah and D. J. Wischik. Optimal scheduling algorithms for input-queued switches. In Proceedings of IEEE Infocom, 2006.
20. S. Shakkottai. Effective capacity and qos for wireless scheduling. IEEE Transactions on Automatic Control, 53(3):749-761, 2008.
21. S. Shakkottai, R. Srikant, and A. Stolyar. Pathwise optimality of the exponential scheduling rule for wireless channels. Advances in Applied Probability, 36(4):1021-1045, 2004.
22. A. L. Stolyar. Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals in Applied Probability, 14(1):1-53, 2004.
23. A. L. Stolyar. Large deviations of queues under qos scheduling algorithms. In Proceedings of Allerton, 2006.
24. L. Tassiulas. Linear complexity algorithms for maximum throughput in radionetworks and input queued switches. In Proceedings of IEEE Infocom, 1998.
25. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1949, December 1992.
26. V. J. Venkataramanan and X. Lin. Structural properties of ldp for queue-length based wireless scheduling algorithms. In Proceedings of Allerton, 2007.
27. W. Whitt. Stochastic-Process Limits. Springer-Verlag, 2001.
28. R. J. Williams. An invariance principle for semimartingale reflecting brownian motions in an orthant. Queueing Syst. Theory Appl., 30(1-2):5-25, 1998.
29. X. Wu and R. Srikant. Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling. In Proceedings of IEEE Infocom, 2006.
30. Y. Yi, A. Proutiere, and M. Chiang. Complexity in wireless scheduling: Impact and tradeoffs. In Proceedings of ACM Mobihoc, 2008.
31. L. Ying, R. Srikant, A. Eryilmaz, and G. E. Dullerud. A large deviations analysis of scheduling in wireless networks. IEEE Transactions on Information Theory, 52(11):5088-5098, 2006. (Pubitemid 44680594)