Queue length stability in trees under slowly convergent traffic using sequential maximal scheduling

IEEE Transactions on Automatic Control

Volumn 53, Issue 10, 2008, Pages 2292-2306

  Sarkar, Saswati ^a   Kar, Koushik ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Sequential maximal scheduling

Indexed keywords

ALGEBRA; GRAPH THEORY; SCHEDULING; TREES (MATHEMATICS);

ARRIVAL PROCESSES; BOUNDED NETWORKS; COMPUTATION TIMES; EMPIRICAL AVERAGES; GENERAL CLASSES; IN TREES; INTERFERENCE CONSTRAINTS; MARKOVIAN; MAXIMUM THROUGHPUTS; NETWORK SIZES; PATH TOPOLOGIES; QUEUE LENGTHS; SCHEDULING POLICIES; SEQUENTIAL MAXIMAL SCHEDULING; STABILITY REGIONS;

WIRELESS NETWORKS;

EID: 56549088050     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2008.2006819     Document Type: Article

References (20)

1. A. Brzezinski, G. Zussman, and E. Modiano, "Distributed throughput maximization in wireless mesh networks - A partitioning approach," in Proc. ACM MOBICOM, Los Angeles, CA, Sep. 2006, CD-ROM.
2. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in multihop wireless networks," in Proc. 43d Annu. Allerton Conf. Commun., Control Comput., Allerton, IL, Sep. 28-30, 2005, CD-ROM.
3. J. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 556-564.
4. J. G. Dai, "On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models," Annals Appl. Prob. vol. 5, pp. 49-77, 1995.
5. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue first scheduling: Second order properties using fluid limits," Adv. Appl. Prob., vol. 38, no. 2, pp. 505-521, Jun. 2006.
6. D. Shah, E. Modiano, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in Proc. ACM SIGMETRICS/IFIP (Performance'06), Jun. 2006, CD-ROM.
7. 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.
8. G. Grimmett and D. Stirzaker, Probability and Random Processes, 3 ed. Oxford, U.K: Oxford Univ. Press, 2001.
9. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. IF-34, no. 6, pp. 910-917, Sep. 1988.
10. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proc. IEEE CDC-ECC'05, San Diego, CA, Dec. 2006, pp. 1258-1263.
11. X. Lin and N. Shroff, "The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks," in Proc. INFOCOM, Miami, FL, Mar. 2005, CD-ROM.
12. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM J. Comput., vol. 15, no. 4, pp. 1036-1055, 1986.
13. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE J. Selected Areas Commun., vol. 23, no. 1, pp. 89-103, Jan. 2005.
14. D. Peleg, Distributed Computing: A Locality-sensitive Approach. Philadelphia, PA: SIAM, 2000.
15. S. Ray and S. Sarkar, "Arbitrary throughput versus complexity trade-offs in wireless networks using graph partitioning," in Proc. Inform. Theory Appl. 2nd Workshop, San Diego, CA, 2007, CD-ROM.
16. T. Salonidis and L. Tassiulas, "Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks," in Proc. ACM MOBIHOC'05, 2005, CD-ROM.
17. D. Shah, P. Giaccone, and B. Prabhakar, "An efficient randomized algorithm for input-queued switch scheduling," IEEE Micro, vol. 22, no. 1, pp. 10-18, Jan./Feb. 2002.
18. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. INFOCOM, 1998, pp. 533-539.
19. L. Tassiulas and A. Ephremidis, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
20. 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.