Dynamic Request Routing for Online Video-on-Demand Service : A Markov Decision Process Approach

الملخص EN

We investigate the request routing problem in the CDN-based Video-on-Demand system.

We model the system as a controlled queueing system including a dispatcher and several edge servers.

The system is formulated as a Markov decision process (MDP).

Since the MDP formulation suffers from the so-called “the curse of dimensionality” problem, we then develop a greedy heuristic algorithm, which is simple and can be implemented online, to approximately solve the MDP model.

However, we do not know how far it deviates from the optimal solution.

To address this problem, we further aggregate the state space of the original MDP model and use the bounded-parameter MDP (BMDP) to reformulate the system.

This allows us to obtain a suboptimal solution with a known performance bound.

The effectiveness of two approaches is evaluated in a simulation study.