NDLI: Hardness of low delay network scheduling

Content Provider	IEEE Xplore Digital Library
Author	Shah, D. Tse, D. Tsitsiklis, J.N.
Copyright Year	2010
Description	Author affiliation: Dept. of EECS, UC Berkeley, Berkeley, CA, USA (Tse, D.)
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).
Starting Page	1
Ending Page	1
File Size	22734
Page Count	1
File Format	PDF
ISBN	9781424463725
e-ISBN	9781424464159
DOI	10.1109/ITWKSPS.2010.5503219
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-01-06
Publisher Place	Egypt
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Throughput Computer networks Signal to noise ratio Polynomials Delay effects Communication networks Wireless networks Interference constraints SINR model Scheduling low-delay high-throughput hardness independent set
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hardness of Low Delay Network Scheduling

A Cross-layer Approach to Optimal Wireless Link Scheduling with SINR Constraints

Wireless Link Scheduling With Power Control and SINR Constraints

Multi-hop routing and scheduling in wireless networks subject to SINR constraints

Hardness of low delay network scheduling.

Locally Optimized Scheduling and Power Control Algorithms for Multi-hop Wireless Networks under SINR Interference Models

Distributed throughput maximization in wireless networks via random power allocation

A cross-layer approach to end-to-end routing and SINR-based scheduling in multi-hop wireless networks

A Study on Radio Interference Estimation Method for Wireless Relay Network Link Scheduling

Hardness of low delay network scheduling

Similar Documents

Hardness of Low Delay Network Scheduling

A Cross-layer Approach to Optimal Wireless Link Scheduling with SINR Constraints

Wireless Link Scheduling With Power Control and SINR Constraints

Multi-hop routing and scheduling in wireless networks subject to SINR constraints

Hardness of low delay network scheduling.

Locally Optimized Scheduling and Power Control Algorithms for Multi-hop Wireless Networks under SINR Interference Models

Distributed throughput maximization in wireless networks via random power allocation

A cross-layer approach to end-to-end routing and SINR-based scheduling in multi-hop wireless networks

A Study on Radio Interference Estimation Method for Wireless Relay Network Link Scheduling

Hardness of low delay network scheduling