Advanced Search
DSpace@MIT

Hardness of Low Delay Network Scheduling

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Shah, Devavrat
dc.contributor.author Tse, David N. C.
dc.contributor.author Tsitsiklis, John N.
dc.date.accessioned 2012-09-12T18:37:48Z
dc.date.available 2012-09-12T18:37:48Z
dc.date.issued 2011-12
dc.date.submitted 2011-03
dc.identifier.issn 0018-9448
dc.identifier.uri http://hdl.handle.net/1721.1/72671
dc.description.abstract We consider a communication network and study the problem of designing a high-throughput and low-delay scheduling policy that only requires a polynomial amount of computation at each time step. The well-known maximum weight scheduling policy, proposed by Tassiulas and Ephremides (1992), has favorable performance in terms of throughput and delay but, for general networks, it can be computationally very expensive. A related randomized policy proposed by Tassiulas (1998) provides maximal throughput with only a small amount of computation per step, but seems to induce exponentially large average delay. These considerations raise some natural questions. Is it possible to design a policy with low complexity, high throughput, and low delay for a general network? Does Tassiulas' randomized policy result in low average delay? In this paper, we answer both of these questions negatively. We consider a wireless network operating under two alternative interference models: (a) a combinatorial model involving independent set constraints and (b) the standard SINR (signal to interference noise ratio) model. We show that unless NP ⊆ BPP (or P = NP for the case of determistic arrivals and deterministic policies), and even if the required throughput is a very small fraction of the network's capacity, there does not exist a low-delay policy whose computation per time step scales polynomially with the number of queues. In particular, the average delay of Tassiulas' randomized algorithm must grow super-polynomially. To establish our results, we employ a clever graph transformation introduced by Lund and Yannakakis (1994). en_US
dc.description.sponsorship National Science Foundation (U.S.). (Grant number CCF-0728554) en_US
dc.language.iso en_US
dc.publisher Institute of Electrical and Electronics Engineers (IEEE) en_US
dc.relation.isversionof http://dx.doi.org/10.1109/tit.2011.2168897 en_US
dc.rights Creative Commons Attribution-Noncommercial-Share Alike 3.0 en_US
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/ en_US
dc.source MIT web domain en_US
dc.title Hardness of Low Delay Network Scheduling en_US
dc.type Article en_US
dc.identifier.citation Shah, Devavrat, David N. C. Tse, and John N. Tsitsiklis. “Hardness of Low Delay Network Scheduling.” IEEE Transactions on Information Theory 57.12 (2011): 7810–7817. en_US
dc.contributor.department Massachusetts Institute of Technology. Laboratory for Information and Decision Systems en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science en_US
dc.contributor.approver Shah, Devavrat
dc.contributor.mitauthor Shah, Devavrat
dc.contributor.mitauthor Tsitsiklis, John N.
dc.relation.journal IEEE Transactions on Information Theory en_US
dc.identifier.mitlicense OPEN_ACCESS_POLICY en_US
dc.eprint.version Author's final manuscript en_US
dc.type.uri http://purl.org/eprint/type/JournalArticle en_US
eprint.status http://purl.org/eprint/status/PeerReviewed en_US
dspace.orderedauthors Shah, Devavrat; Tse, David N. C.; Tsitsiklis, John N. en


Files in this item

Name Size Format
Downloadable Full Text - PDF

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-Noncommercial-Share Alike 3.0 Except where otherwise noted, this item's license is described as Creative Commons Attribution-Noncommercial-Share Alike 3.0
Open Access