Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks
Queueing Systems: Theory and Applications
Performance Evaluation and Policy Selection in Multiclass Networks
Discrete Event Dynamic Systems
In Search of Sensitivity in Network Optimization
Queueing Systems: Theory and Applications
Reliability by design in distributed power transmission networks
Automatica (Journal of IFAC)
Stochastic analysis of multiserver systems
ACM SIGMETRICS Performance Evaluation Review
Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules
Operations Research
Robotics and Computer-Integrated Manufacturing
Fluid analysis of an input control problem
Queueing Systems: Theory and Applications
Queuing model based on scheduling strategies affect local network services
CIS'09 Proceedings of the international conference on Computational and information science 2009
Coding and control for communication networks
Queueing Systems: Theory and Applications
A differential game formulation of a controlled network
Queueing Systems: Theory and Applications
Asymptotically Optimal Controls for Time-Inhomogeneous Networks
SIAM Journal on Control and Optimization
Continuization of timed petri nets: from performance evaluation to observation and control
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
Part II continues the development of policy synthesis techniques for multiclass queueing networks based upon a linear fluid model. The following are shown: A relaxation of the fluid model based on workload leads to an optimization problem of lower dimension. An analogous workload-relaxation is introduced for the stochastic model. These relaxed control problems admit pointwise optimal solutions in many instances. A translation to the original fluid model is almost optimal, with vanishing relative error as the network load $\rho$ approaches one. It is pointwise optimal after a short transient period, provided a pointwise optimal solution exists for the relaxed control problem. A translation of the optimal policy for the fluid model provides a policy for the stochastic network model that is almost optimal in heavy traffic, over all solutions to the relaxed stochastic model, again with vanishing relative error. The regret is of order $|\log(1-\rho)|$.