A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
From MaRDI portal
Publication:1085077
DOI10.1016/0167-6377(86)90096-9zbMath0606.90128OpenAlexW2078002625MaRDI QIDQ1085077
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90096-9
resource allocationcommunication networksexponentially distributed transition timesgeneral semi-Markov decision problemoptimal sharingvalue-iteration algorithm
Related Items
Asymptotic optimality of tracking policies in stochastic networks. ⋮ A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks ⋮ Approximations for multi-server queues: System interpolations ⋮ Optimization problems in chemical reactions using continuous-time Markov chains ⋮ A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues ⋮ Approximating queue size and waiting time distributions in general polling systems ⋮ Optimal assignment policy of a single server attended by two queues ⋮ Simultaneous optimization of flow control and scheduling in a single server queue with two job classes ⋮ Simultaneous optimization of flow-control and scheduling in a single server queue with two job classes: Numerical results and approximation ⋮ Information theoretic analysis for queueing systems with quasi-random input ⋮ Effective bandwidths for Markov regenerative sources ⋮ Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Analyzing \(GI/E_ r/1\) queues ⋮ Value of capacity pooling in supply chains with heterogeneous customers ⋮ Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing ⋮ Interval uneffectiveness distribution for a k-out-of-n multistate reliability system with repair ⋮ Shortest expected delay routing for Erlang servers ⋮ Infinite- and finite-buffer Markov fluid queues: a unified analysis ⋮ Analysis of the stationary \(E_ k/C_ 2/s\) queueing system ⋮ Machining economics with phase-type distributed tool lives and periodic maintenance control ⋮ Exact solutions for open, closed and mixed queueing networks with rejection blocking ⋮ Statistical performance of a multiclass bulk production queueing system ⋮ Genetic algorithms and call admission to telecommunications networks ⋮ Comparing two queueing models for nonhomogeneous nonreliable terminal systems ⋮ On the rate of convergence of \(L\)- and \(R\)-statistics under alternatives ⋮ Generalisation of a waiting-time relation ⋮ Error bounds on a practical approximation for finite tandem queues ⋮ Optimal control of a simple immigration-birth-death process through total catastrophes ⋮ Enhanced lateral transshipments in a multi-location inventory system ⋮ \(N\) parallel queueing systems with server breakdown and repair ⋮ Optimization and optimality of a joint pricing and inventory control policy in periodic-review systems with lost sales ⋮ Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities. ⋮ Mean sojourn times in two-queue fork-join systems: bounds and approximations ⋮ Strong truncation approximation in tandem queues with blocking ⋮ Optimal claim behaviour for third-party liability insurances or To claim or not to claim: that is the question ⋮ Markov decision processes with multiple costs ⋮ Optimal control of variable rate coding with incomplete observation in integrated voice/data packet networks ⋮ Opportunity-based block replacement ⋮ Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes ⋮ Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach ⋮ Counterexamples for comparisons of queues with finite waiting rooms ⋮ The Fourier-series method for inverting transforms of probability distributions ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ Approximate uniformization for continuous-time Markov chains with an application to performability analysis ⋮ Queueing analysis of a server node in transaction processing middleware systems ⋮ Switched Poisson \(\text{process}/G/1\) queue with service interruptions ⋮ A Markov decision algorithm for optimal pest control through uniform catastrophes ⋮ On product form approximations for communication networks with losses: Error bounds ⋮ Cyclic reservation schemes for efficient operation of multiple-queue single-server systems ⋮ A note on a stochastic location problem ⋮ Optimal claim behaviour for vehicle damage insurances ⋮ Review of a Markov decision algorithm for optimal inspections and revisions in a maintenance system with partial information ⋮ Routing and buffer allocation models for a telecommunication system with heterogeneous devices ⋮ Policy iteration and Newton-Raphson methods for Markov decision processes under average cost criterion ⋮ \(M/G/1/N\) vacation model with varying \(E\)-limited service discipline ⋮ Illustrated review of convergence conditions of the value iteration algorithm and the rolling horizon procedure for average-cost MDPs ⋮ Buffer allocation in general single-server queueing networks ⋮ An impulse control problem of a production model with interruptions to follow stochastic demand ⋮ Cost analysis of the unloader queueing system with a single unloader subject to breakdown with two types of trailers ⋮ Semi-Markov decision models for real-time scheduling ⋮ Some results on a generalized \(M/G/1\) feedback queue with negative customers ⋮ Hierarchical production planning for consumer goods ⋮ Ruin probability by operational calculus ⋮ Computational approximations of renewal process relating to a warranty problem: The case phase-type lifetimes ⋮ A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes ⋮ Optimal access control for broadband services: Stochastic knapsack with advance information ⋮ An appointment-based service center with guaranteed service ⋮ Distribution planning for a divergent depotless two-echelon network under service constraints ⋮ Simple performance estimates and error bounds for slotted ALOHA loss systems ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Optimal solutions for the machining economics problem with stochastically distributed tool lives ⋮ Analyzing \(E_k/E_r/ c\) queues ⋮ Production strategies for a stochastic lot-sizing problem with constant capacity ⋮ Dual and selfdual networks of queues with rejection blocking ⋮ Production planning and inventory control with remanufacturing and disposal ⋮ The design of robotic dairy barns using closed queueing networks ⋮ Higher order approximations for tandem queueing networks ⋮ On the Optimality of Trunk Reservation in Overflow Processes ⋮ A simulated annealing applied for optimizing a voice-multihop radio network ⋮ A performance-based methodology to early evaluate the effectiveness of mobile software architectures ⋮ A \(P_{\lambda}^M\)-policy for an \(M/G/1\) queueing system ⋮ Look-back policies for two-stage, pull-type production/inventory systems ⋮ An investigation of phase-distribution moment-matching algorithms for use in queueing models ⋮ A graphical investigation of error bounds for moment-based queueing approximations
Cites Work
- Unnamed Item
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Iterative solution of the functional equations of undiscounted Markov renewal programming
- Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Discrete versions of an algorithm due to Varaiya
- Sharing Memory Optimally
- On Finding the Maximal Gain for Markov Decision Processes