Abstract

The theory of Markov decision process (MDP) has been widely applied to the networking management such as routing and admission control. However, the traditional MDP approach is mainly hindered by prohibitive computational complexity. The performance theory offers an efficient solution to alleviate such difficulties in infinite-horizon MDP problems. The concept potential leads to some important properties that allow it to be measured on a single sample path, thereby adapting to the dynamic characteristics in realistic applications such as high speed networks. In this paper, we investigate the application of single-sample-path-based theory to the admission control in the network with multiple classes of traffic. Optimal policies under different traffic characteristics are obtained with a fast convergence. Some simple and efficient algorithms are developed for online implementation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.