[go: up one dir, main page]

Veatch, 2005 - Google Patents

Approximate dynamic programming for networks: Fluid models and constraint reduction

Veatch, 2005

View PDF
Document ID
1214925903252298799
Author
Veatch M
Publication year
Publication venue
preprint

External Links

Snippet

This paper demonstrates the feasibility of using approximate linear programming (ALP) to compute nearly optimal average cost for multiclass queueing network control problems. ALP works directly with the LP form of the optimality equations, but approximates the differential …
Continue reading at www.math-cs.gordon.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design

Similar Documents

Publication Publication Date Title
Altman Constrained Markov decision processes
Kim et al. A survey of retrial queueing systems
Iida et al. Approximate solutions of a dynamic forecast-inventory model
Even-Dar et al. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems.
Dai et al. State space collapse in many-server diffusion limits of parallel server systems
Tsitsiklis et al. On the power of (even a little) resource pooling
Chen et al. Value iteration and optimization of multiclass queueing networks
Veatch Approximate dynamic programming for networks: Fluid models and constraint reduction
Cogill et al. An approximate dynamic programming approach to decentralized control of stochastic systems
Adusumilli et al. Dynamic admission and service rate control of a queue
Maglaras Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
Suri New techniques for modelling and control of flexible automated manufacturing systems
Marin et al. A queueing model that works only on the biggest jobs
Wah et al. Genetics-based learning of new heuristics: Rational scheduling of experiments and generalization
Koole Convexity in tandem queues
Choi et al. Relative value function approximation for the capacitated re-entrant line scheduling problem
Van Der Wal et al. Dynamic visit-order rules for batch-service polling
Onderwater et al. Value function discovery in markov decision processes with evolutionary algorithms
Yang et al. Optimal resource allocation for multiqueue systems with a shared server pool
Blanc An algorithmic solution of polling models with limited service disciplines
Maglaras Continuous-review tracking policies for dynamic control of stochastic networks
Datta Applied and Computational Control, Signals, and Circuits: Volume 1
van der Laan The structure and performance of optimal routing sequences
Squillante et al. Generalized parallel-server fork-join queues with dynamic task scheduling
Yao Dynamic scheduling via polymatroid optimization