Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks

Ever since Tassiulas and Ephremides in 1992 proposed the maximum weight scheduling algorithm of throughput optimality for constrained queueing networks that arise in the context of communication networks, extensive efforts have been devoted to resolving its most important drawback: high complexity. This paper proposes a generic framework for designing throughput-optimal and low-complexity scheduling algorithms for constrained queueing networks. Under our framework, a scheduling algorithm updates current schedules by interacting with a given oracle system that generates an approximate solution to a related optimization task. One can use our framework to design a variety of scheduling algorithms by choosing an oracle system such as random 7524 Markov chain, belief propagation, and primal-dual methods. The complexity of the resulting scheduling algorithm is determined by the number of operations required for an oracle to process a single query, which is typically small. We provide sufficient conditions for throughput optimality of the scheduling algorithm, in general, constrained queueing network models. The linear time algorithm of Tassiulas in 1998 and the random access algorithm of Shah and Shin in 2012 correspond to special cases of our framework using random search and Markov chain oracles, respectively. Our generic framework, however, provides a unified proof with milder assumptions.
Publisher
INFORMS
Issue Date
2017-08
Language
English
Keywords

INPUT-QUEUED SWITCHES; MAXIMUM THROUGHPUT; RADIO NETWORKS; STABILITY; ALGORITHMS

Citation

MATHEMATICS OF OPERATIONS RESEARCH, v.42, no.3, pp.723 - 744

ISSN
0364-765X
DOI
10.1287/moor.2016.0824
URI
http://hdl.handle.net/10203/225614
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 48
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0