Hardness of low delay network scheduling

IEEE Transactions on Information Theory

Volumn 57, Issue 12, 2011, Pages 7810-7817

  Shah, Devavrat ^a   Tse, David N C ^b   Tsitsiklis, John N ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Hardness; high throughput; independent set; low delay; scheduling; SINR model

Indexed keywords

AVERAGE DELAY; COMBINATORIAL MODELS; GENERAL NETWORKS; GRAPH TRANSFORMATION; HIGH-THROUGHPUT; INDEPENDENT SET; INTERFERENCE MODELS; LOW COMPLEXITY; LOW DELAY; MAXIMAL THROUGHPUT; RANDOMIZED ALGORITHMS; SCHEDULING POLICIES; SIGNAL TO INTERFERENCE-NOISE RATIOS; TIME STEP;

HARDNESS; SCHEDULING; SIGNAL INTERFERENCE; SPURIOUS SIGNAL NOISE;

THROUGHPUT;

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

References (13)

1. L. L. Cam, "An approximation theorem for the Poisson binomial distribution," Pacific J. Math., vol. 10, no. 4, pp. 1181-1197, 1960.
2. J. H. Davis, Ed., "Special issue on mobile radio communications," IEEE J. Sel. Areas Commun., 1984.
3. K. Jung and D. Shah, "Low delay scheduling in wireless network," presented at the IEEE Int. Symp. Information Theory, 2007.
4. F. P. Kelly, "Stochastic models of computer communication systems," J. Roy. Statist. Soc. B, pp. 379-395, 1985.
5. C. Lund and M. Yannakakis, "On the hardness of approximating minization problems," J. ACM, vol. 41, no. 5, pp. 960-981, 1994.
6. Z. Luo and S. Zhang, "Dynamic spectrum management: Complexity and duality," IEEE J. Sel. Topics Signal Process., vol. 2, no. 1, p. 57, Jan. 2008.
7. D. Mitra and P. J. Weinberger, "Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics," J. ACM, vol. 31, no. 4, pp. 855-878, 1984.
8. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless network via gossiping," ACM SIGMETRICS/Performance, 2006.
9. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
10. D. Shah, Gossip Algorithms. New York: Now Publishers, 2009, vol. 3.
11. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, 1998, vol. 2, pp. 533-539.
12. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, pp. 1936-1948, 1992.
13. L. Trevisan, "Non-approximability results for optimization problems on bounded degree instances," ACM STOC, 2001.