Throughput and fairness guarantees through maximal scheduling in wireless networks

IEEE Transactions on Information Theory

Volumn 54, Issue 2, 2008, Pages 572-594

  Chaporkar, Prasanna ^a   Kar, Koushik ^b   Luo, Xiang ^b   Sarkar, Saswati ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Fairness guarantees; Maximal scheduling; Throughput guarantees; Wireless networks

Indexed keywords

INFORMATION THEORY; SCHEDULING; THROUGHPUT; TOPOLOGY; TRANSCEIVERS;

FAIRNESS GUARANTEES; MAXIMAL SCHEDULING; THROUGHPUT GUARANTEES;

WIRELESS NETWORKS;

EID: 39849105691     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.913537     Document Type: Article

References (25)

1. M. Alicherry, R. Bhatia, and L. Li, "Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks," i IEEE J. Sel. Areas Commun.: Special Issue on Multihop Wireless Mesh Networks i, vol. 24, no. 11, pp. 1960-1971, Nov. 2006.
2. D. Bertsekas and R. Gallager, i Data Networks i, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 1992.
3. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu, "Joint asynchronous congestion control and distributed scheduling for multihop wireless networks," in i Proc. INFOCOM i, Barcelona, Spain, Apr. 2006.
4. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in multihop, wireless networks," in i Proc. 43rd Annu. Allerton Conf. Communication, Control and Computing i, Monticello, IL, Sep. 2005.
5. P. Chaporkar, K. Kar, and S. Sarkar, "Achieving queue length stability through maximal scheduling in wireless networks," in i Proc. Information Theory and Applications Inaugural Workshop i, San Diego, La Jolla, CA, Feb. 2006.
6. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input output queued switch," i IEEE J. Sel. Areas Commun. i, vol. 17, no. 6, pp. 1030-1039, Dec. 1999.
7. J. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in i Proc. INFOCOM i, Tel-Aviv, Israel, Mar. 2000, pp. 556-564.
8. G. Fayolle, V. A. Malyshev, and M. V. Menshikov, Topics in the Constructive Theory of Countable Markov Chains. Cambridge, U.K.: Cambridge Univ. Press, 1995.
9. S. Kravitz, "Packing cylinders into cylindrical containers," Math. Mag., vol. 40, pp. 65-70, 1967.
10. X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks," in Proc. INFOCOM, Miami, FL, Mar. 2005, vol. 3, pp. 1804-1814.
11. M. Luby, "An efficient randomized algorithm for input-queued switch scheduling," SIAM J. Comput., vol. 15, no. 4, pp. 1036-1055, Nov. 1986.
12. M. V. Marathe, H. Breu, H. B. Hunt, III, S. S. Ravi, and D. J. Rosenkrantz, "Simple heuristics for unit disk graphs," Networks, vol. 25, pp. 59-68, 1995.
13. D. Peleg, Distributed Computing: A Locality-sensitive Approach. Philadelphia, PA: Soc. Ind. Appl. Math., 2000.
14. W. Rudin, Real and Complex Analysis. New York: McGraw Hill, 1987.
15. S. Sarkar, P. Chaporkar, and K. Kar, "Fairness and throughput guarantees with maximal scheduling in multihop, wireless networks," in Proc. 4th Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Boston, MA, Apr. 2006.
16. S. Sarkar and K. N. Sivarajan, "Fairness in wireless mobile networks," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2412-2426, Aug. 2002.
17. S. Sarkar and L. Tassiulas, "End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks," IEEE Trans. Autom. Control, vol. 50, no. 9, pp. 1246-1259, Sep. 2005.
18. D. Shah, P. Giaccone, and B. Prabhakar, "An efficient randomized algorithm for input-queued switch scheduling," IEEE Micro., vol. 22, no. 1, pp. 19-25, Jan./Feb. 2002.
19. G. Sharma, N. Shroff, and R. Mazumdar, "On the complexity of scheduling in multi-hop wireless systems," in Proc. IEEE Int. Workshop on Foundations and Algorithms for Wireless Networking (FAWN , Pisa, Italy, Mar. 2006.
20. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proce. INFOCOM, San Francisco, CA, Mar. 1998, pp. 533-539.
21. L. Tassiulas and A. Ephremidis, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
22. L. Tassiulas and S. Sarkar, "Maxmin fair scheduling in wireless ad hoc networks," IEEE J. Sel. Areas Commun., Special Issue on Ad Hoc Networks, Part I, vol. 23, no. 1, pp. 163-173, Jan. 2005.
23. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multihop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE CDC-ECC'05, Seville, Spain, Dec. 2005, pp. 5342-5347.
24. X. Wu and R. Srikant, "Bounds on the capacity region of multihop, wireless networks under distributed greedy scheduling," in Proc. INFOCOM, Barcelona, Spain, Apr. 2006.
25. X. Wu, R. Srikant, and J. R. Perkins, "Queue length stability of maximal greedy schedules in wireless networks," in Proc. Information Theory and Applications Inaugural Workshop, San Diego, La Jolla, CA, Feb. 2006.