Optimal Admission Control Policy Based on Memetic Algorithm in Distributed Real Time Database System
- PDF / 2,158,820 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 3 Downloads / 180 Views
Optimal Admission Control Policy Based on Memetic Algorithm in Distributed Real Time Database System Nupa Ram Chauhan1 · Surya Prakash Tripathi2 Accepted: 29 October 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Recently distributed real-time database systems are intended to manage large volumes of dispersed data. To develop distributed real-time data processing, a reality and stay competitive well defined protocols and algorithms must be required to access and manipulate the data. An admission control policy is a major task to access real-time data which has become a challenging task due to random arrival of user requests and transaction timing constraints. This paper proposes an optimal admission control policy based on deep reinforcement algorithm and memetic algorithm which can efficiently handle the load balancing problem without affecting the Quality of Service (QoS) parameters. A Markov decision process (MDP) is formulated for admission control problem, which provides an optimized solution for dynamic resource sharing. The possible solutions for MDP problem are obtained by using reinforcement learning and linear programming with an average reward. The deep reinforcement learning algorithm reformulates the arrived requests from different users and admits only the needed request, which improves the number of sessions of the system. Then we frame the load balancing problem as a dynamic and stochastic assignment problem and obtain optimal control policies using memetic algorithm. Therefore proposed admission control problem is changed to memetic logic in such a way that session corresponds to individual elements of the initial chromosome. The performance of proposed optimal admission control policy is compared with other approaches through simulation and it depicts that the proposed system outperforms the other techniques in terms of throughput, execution time and miss ratio which leads to better QoS. Keywords Reinforcement learning · Linear programming · Objective function · Transaction request
* Nupa Ram Chauhan [email protected] 1
Computer Science and Engineering Department, FGIET, Raebareli, Uttar Pradesh 229001, India
2
Computer Science and Engineering Department, IET Lucknow, Lucknow, Uttar Pradesh 226021, India
13
Vol.:(0123456789)
N. R. Chauhan, S. P. Tripathi
1 Introduction A distributed real-time database system (DRTDBS) is slightly different from Distributed Database System (DDBS). A set of database systems connected through a network namely Distributed DBS is dispersed over a network, the transactions over which will have explicit time constraints [1]. The DRTDBS are useful in several places like educational institutions, banking sector, stock market, military organization etc., mainly, the algorithms for DRTDBS are intended to complete the transaction successfully before its deadline, while throughput is not a major factor. Every transaction will have a deadline in terms of time which leads the transaction to complete successfully in DRTDBS [2].
Data Loading...
