SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
3 references·10 citing·39 second hop
Optimal scheduling of interactive and noninteractive traffic in telecommunication systems (1988)Optimal scheduling of interactive and non…Optimal priority assignment with hard constraint (1986)Optimal priority assignment w…A Characterization of Waiting Time Performance Realizable by Single-Server Queues (1980)A Characterization of Waiting…Dynamic Scheduling of a Multiclass Queue: Discount Optimality (1975)Dynamic Scheduling of a Multi…Delay and rate-optimal control in a multi-class priority queue with adjustable service rates (2012)Delay and rate-optimal contro…Resource Allocation Among Agents with MDP-Induced Preferences (2006)Resource Allocation Among Age…Delay analysis of a probabilistic priority discipline (2002)Delay analysis of a probabili…Constrained Markov Games: Nash Equilibria (2000)Constrained Markov Games: Nas…Adaptive Lexicographic Optimization in Multi-Class M/GI/1 Queues (1993)Adaptive Lexicographic Optimi…Optimal control of admission to a multiserver queue with two arrival streams (1992)Optimal control of admission …Optimal allocation of a server between two queues with due times (1991)Optimal allocation of a serve…Optimal queueing discipline for real-time traffic at ATM switching nodes (1990)Optimal queueing discipline f…Optimal priority assignment: a time sharing approach (1989)Optimal priority assignment: …Optimal dynamic scheduling in Jackson networks (1989)Optimal dynamic scheduling in…Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Optimal flow control of a class of queueing networks in equilibrium (1983)On the existence of equilibria in noncooperative optimal flow control (1995)Zero-sum constrained stochastic games with independent state processes (2005)New directions in communications (or which way to the information age?) (1986)Stochastic analysis of computer and communication systems (1990)Analysis and Synthesis of Computer Systems (2010)K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal (1985)The c μ rule revisited (1985)Suboptimality Bounds in Stochastic Control: A Queueing Example (2006)Time-shared Systems (1967)Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic (2000)Analysis, Design, and Control of Queueing Systems (2002)Dynamic priority allocation via restless bandit marginal productivity indices (2007)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Time-Sharing Service Systems. I (1975)Interchange arguments in stochastic scheduling (1989)Performance evaluation of scheduling control of queueing networks: Fluid model heuristics (1995)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Multipart pricing of public goods (1971)Incentives in Teams (1973)Principles of Operations Research. (1970)Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server (1971)Dynamic Decisions and Work Load in Multitask Supervisory Control (1980)Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue (1991)Four proofs of Gittins’ multiarmed bandit theorem (2014)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)A simple dynamic routing problem (1980)Optimal control of admission to a quenching system (1985)A fuzzy approach to the flow control problem (1998)Fuzzy control of arrivals to tandem queues with two stations (1999)Stochastic Processes, Optimization, and Control Theory: Applications in Financial Engineering, Queueing Networks, and Manufacturing Systems (2006)Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs (1989)Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems (1996)Dynamic Control of a Queue with Adjustable Service Rate (2001)Multi-Armed Bandits and the Gittins Index (1980)Extensions of the multiarmed bandit problem: The discounted case (1985)Boundary value problems in queueing theory (1988)Denumerable Constrained Markov Decision Processes and Finite Approximations (1994)
this work references cited by second hop

References

  • 1980A Characterization of Waiting Time Performance Realizable by Single-Server Queues156 cited
  • 1975Dynamic Scheduling of a Multiclass Queue: Discount Optimality148 cited
  • 1986Optimal priority assignment with hard constraint64 cited

Cited by

  • 2000Constrained Markov Games: Nash Equilibria58 cited
  • 2006Resource Allocation Among Agents with MDP-Induced Preferences44 cited
  • 1990Optimal queueing discipline for real-time traffic at ATM switching nodes43 cited
  • 1989Optimal priority assignment: a time sharing approach40 cited
  • 1989Optimal dynamic scheduling in Jackson networks38 cited
  • 1992Optimal control of admission to a multiserver queue with two arrival streams32 cited
  • 2012Delay and rate-optimal control in a multi-class priority queue with adjustable service rates26 cited
  • 2002Delay analysis of a probabilistic priority discipline22 cited
  • 1993Adaptive Lexicographic Optimization in Multi-Class M/GI/1 Queues17 cited
  • 1991Optimal allocation of a server between two queues with due times16 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work