On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm

AbstractProbably, the most reputed solution for partitioning, which has applications in databases, attribute partitioning, processor-based assignment and many other similar scenarios, is the object migration automata (OMA). However, one of the known deficiencies of the OMA is that when the problem size is large, i.e., the number of objects and partitions are large, the probability of receiving a reward, which “strengthens” the current partitioning, from the Environment is not significant. This is because of an internal deadlock scenario which is discussed in this paper. As a result of this, it can take the OMA a considerable number of iterations to recover from an inferior configuration. This property, which characterizes learning automaton (LA) in general, is especially true for the OMA-based methods. In spite of the fact that various solutions have been proposed to remedy this issue for general families of LA, overcoming this hurdle is a completely unexplored area of research for conceptualizing how the OMA should interact with the Environment. Indeed, the best reported version of the OMA, the enhanced OMA (EOMA), has been proposed to mitigate the consequent deadlock scenario. In this paper, we demonstrate that the incorporation of the intrinsic properties of the Environment into the OMA’s design leads to a higher learning capacity and to a more consistent partitioning. To achieve this, we incorporate the state-of-the-art pursuit principle utilized in the field of LA by estimating the Environment’s reward/penalty probabilities and using them to further augment the EOMA. We also verify the performance of our proposed method, referred to as the pursuit EOMA (PEOMA), through simulation, and demonstrate a significant increase in the convergence rate, i.e., by a factor of about forty. It also yields a noticeable reduction in sensitivity to the noise in the Environment. The paper also includes some results obtained for a real-world application domain involving faulty sensors.

[1]  Daniel Chiu Yu Ma.  Object partitioning by using learning automata , 1986 .

[2]  Akaki Jobava,et al.  Intelligent Traffic-aware Consolidation of Virtual Machines in a Data Center , 2015 .

[3]  B. John Oommen,et al.  On enhancing the object migration automaton using the Pursuit paradigm , 2017, J. Comput. Sci..

[4]  Arvola Chan,et al.  Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.

[5]  B. John Oommen,et al.  Achieving Microaggregation for Secure Statistical Databases Using Fixed-Structure Partitioning-Based Learning Automata , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  Michael Hammer,et al.  A heuristic approach to attribute partitioning , 1979, SIGMOD '79.

[7]  MengChu Zhou,et al.  Fast Variable Structure Stochastic Automaton for Discovering and Tracking Spatiotemporal Event Patterns , 2018, IEEE Transactions on Cybernetics.

[8]  B. John Oommen,et al.  On Utilizing the Pursuit Paradigm to Enhance the Deadlock-Preventing Object Migration Automaton , 2017, 2017 International Conference on New Trends in Computing Sciences (ICTCS).

[9]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[10]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[11]  Clement T. Yu,et al.  Adaptive record clustering , 1985, TODS.

[12]  M. L. Tsetlin,et al.  Automaton theory and modeling of biological systems , 1973 .

[13]  Clement T. Yu,et al.  Improvements to an Algorithm for Equipartitioning , 1990, IEEE Trans. Computers.

[14]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[15]  Mohammad Reza Meybodi,et al.  A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks , 2010, Comput. Networks.

[16]  Mohammad S. Obaidat,et al.  Adaptive and Learning Systems , 2010, IEEE Trans. Syst. Man Cybern. Part B.

[17]  Anis Yazidi,et al.  Service selection in stochastic environments: a learning-automaton based solution , 2012, Applied Intelligence.

[18]  Eugene C. Freuder.  The Object Partition Problem , 1971 .

[19]  Anis Yazidi,et al.  Achieving Intelligent Traffic-Aware Consolidation of Virtual Machines in a Data Center Using Learning Automata , 2016, 2016 8th IFIP International Conference on New Technologies, Mobility and Security (NTMS).

[20]  Abdolreza Shirvani,et al.  Novel Solutions and Applications of the Object Partitioning Problem , 2018 .

[21]  B. John Oommen,et al.  A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists , 2007, Comput. J..

[22]  Ali Safari Mamaghani,et al.  A Learning Automaton Based Approach for Data Fragments Allocation in Distributed Database Systems , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.