Loading...

On the possibility of network scheduling with polynomial complexity and delay

Sharifnassab, A ; Sharif University of Technology

313 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TNET.2017.2761191
  3. Abstract:
  4. Considering the collection of all networks with independent set interference model, Shah, Tse, and Tsitsiklis showed that there exist scheduling algorithms with polynomial complexity and delay, only if the maximum independent set problem can be solved in polynomial time (equivalently, P=NP). In this paper, we extend this result to arbitrary collections of networks and present a clear-cut criterion for the existence of polynomial complexity and delay scheduling algorithms relative to a given collection of networks with arbitrary interference models, not confined to independent set interference or SINR models, and not necessarily encompassing all network topologies. This amounts to the equivalence of polynomial scheduling and effective approximation of maximum weighted actions. IEEE
  5. Keywords:
  6. SINR interference ; Subgradient approximation ; Computational complexity ; Polynomial approximation ; Polynomials ; Scheduling ; Scheduling algorithms ; Signal interference ; Complexity ; Delay ; Distributed scheduling ; Interference modeling ; Interference models ; Maximum independent sets ; Polynomial complexity ; Subgradient ; Complex networks
  7. Source: IEEE/ACM Transactions on Networking ; 2017 ; 10636692 (ISSN)
  8. URL: https://ieeexplore.ieee.org/document/8103035