REFERENCES
- Apache webserver documentation. http://httpd.apache.org/docs/2.4/caching.html.
- SURFSara. http://www.surfsara.nl.
- Altman, E.; Gaujal, B.; Hordijk, A.; Koole, G. Optimal admission, routing and service assignment control: the case of single buffer queues. In Proceedings of the 37th IEEE Conference on Decision and Control, 1998, volume ; 2119–2124. IEEE, 1998.
- Bhulai, S. Markov decision processes: The control of high-dimensional systems. PhD thesis, Universal Press: Netherlands, 2002.
- Bhulai, S. Dynamic routing policies for multiskill call centers. Probab. Eng. Inform. Sci. 2009, 23, 101.
- Bhulai, S.; Koole, G. On the structure of value functions for threshold policies in queueing models. J. Appl. Probab. 2003, 20, 613–622.
- Dahlin, M. Interpreting stale load information. IEEE Transactions on Parallel and Distributed Systems 2000, 11, 1033–1047.
- Haijema, R.; Van der Wal, J. An MDP decomposition approach for traffic control at isolated signalized intersections. Probab. Eng. Inform. Sci. 2008, 22, 587–602.
- Hernández-Lerma, O.; Lasserre, J.B. Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer: New York, 1996.
- Ho, Y.; Zhao, Q.; Jia, Q. Ordinal Optimization: Soft Optimization for Hard Problems. Springer: Boston, 2007.
- Lippman, S.A. Applying a new device in the optimization of exponential queuing systems. Operations Research 1975, 23, 687–710.
- Mitici, Mihaela; Onderwater, Martijn; de Graaf, Maurits; van Ommeren, Jan-Kees; van Dijk, Nico; Goseling, Jasper; Boucherie, RichardJ. Optimal query assignment for wireless sensor networks. Int. J. Elect. Comm. (AEU) 2015, 69, 1102–1112.
- Mitzenmacher, M. How useful is old information?. IEEE Transactions on Parallel and Distributed Systems 2000, 11, 6–20.
- Norman, J.M. Heuristic procedures in dynamic programming. Manchester University Press: Manchester, 1972.
- Ott, T.J.; Krishnan, K.R. Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic. Ann. Oper. Res. 1992, 35, 43–68.
- RFC5861. http://www.rfc-editor.org/rfc/rfc5861.txt.
- Sassen, S. A.E.; Tijms, H.C.; Nobel, R.D. A heuristic rule for routing customers to parallel servers. Statistica Neerlandica 1997, 51, 107–121.
- Serfozo, R.F. An equivalence between continuous and discrete time Markov decision processes. Oper. Res. 1979, 27, 616–620.
- Spieksma, F.M. Geometrically ergodic Markov chains and the optimal control of queues. PhD thesis, Rijksuniversiteit Leiden, Leiden, 1990.
- White, D.J. Dynamic programming, Markov chains, and the method of successive approximations. J. Math. Anal. Appl. 1963, 6, 373–376.
- Wijngaard, J. Decomposition for dynamic programming in production and inventory control. Eng. Process Econ. 1979, 4, 385–388.