On the Exploration of Equal Length Cellular Automata Rules Targeting a MapReduce Design in Cloud

Abstract

A MapReduce design with Cellular Automata (CA) is presented in this research article to facilitate load-reduced independent data processing and cost-efficient physical implementation in heterogeneous Cloud architecture. Equal Length Cellular Automata (ELCA) are considered for the design. This article explores ELCA rules and presents an ELCA based MapReduce design in cloud. New algorithms are presented for i) synthesis, ii) classification of ELCA rules, and iii) ELCA based MapReduce design in Cloud. Shuffling and efficient reduction of data volume are ensured in proposed MapReduce design.

Design of Cellular Automata based Linear Rules in Multilingual Encryption for Performance Optimization in Wireless Network

“…A novel multilingual adaptive encryption technique has been proposed using phonetic based ciphering with maintaining cryptography protocol [16]. Map Reduce design has been proposed in cloud depending on the exploration of equal length cellular automata rules [17]. Authors have proposed a cost efficient approach for authenticating one time password in cloud environment using equal length cellular automata [18].…”

On the Exploration of the Natural Sequence of Primes With Cellular Automata Targeting Enhanced Data Security and Privacy

“…An n -cell CDCA (compositeness detecting CA) model towards detecting the primality or compositeness of an odd number in the range of 2 1 n− to 2 1 n − was presented in (Maiti et al, 2014). On the other hand, group CA attracted a special attention of researchers for its rich characteristics and potentiality towards modelling of distributed and scientific applications (Ganguly et al, 2001;and Mitra et al, 2016). To explore the application suitability by CAs, several CA dynamics were further investigated by researchers.…”

“…Several fixed boundary conditions towards ECA dynamics were presented in (Salman, 2013;Aquiar et al, 2015;Teodorescu, 2015;Mitra et al, 2016;and Mitra, 2018). We followed the same notation as presented in (Mitra et al, 2016) towards the representation of several fixed boundary condition (i.e., 0 0 … , 0 1 … , 1 0 … , and 1 1 … ). Past researches explored that ECA dynamics may exhibit differences at several fixed boundary scenarios.…”

“…If the first cell and last cell of an ECA configuration is connected to ground (null), is referred to as a null boundary scenario. Different other conditions for the boundary values at fixed boundary ECA configurations and its effects in corresponding ECA dynamics were presented in several researches (Salman, 2013;Aquiar et al, 2015;and Mitra et al, 2016). Few relevant basic CA terminologies as discussed in (Ganguly et al, 2001) are further presented as below.…”

“…Next state function of CA rule with a combination of XOR and XNOR are referred to as Additive CA (ACA) and concerned CA rules are known as additive CA rules; remaining CA rules are known as non-linear CA rules. If CA generated subspaces involves only cycles, is referred to as group CA; else it is referred to as nongroup CA (Ganguly et al, 2001;and Mitra et al, 2016).…”