Intelligent Techniques for Providing Effective Security to Cloud Databases

Author(s):  
Ar Arunarani ◽  
D Manjula Perkinian

Cloud databases have been used in a spate of web-based applications in recent years owing to their capacity to store big data efficiently. In such a scenario, access control techniques implemented in relational databases are so modified as to suit cloud databases. The querying features of cloud databases are designed with facilities to retrieve encrypted data. The performance with respect to retrieval and security needs further improvements to ensure a secured retrieval process. In order to provide an efficient secured retrieval mechanism, a rule- and agent-based intelligent secured retrieval model has been proposed in this paper that analyzes the user, query and contents to be retrieved so as to effect rapid retrieval with decryption from the cloud databases. The major advantage of this retrieval model is in terms of its improved query response time and enhanced security of the storage and retrieval system. From the experiments conducted in this work, proposed model increased storage and access time and, in addition, intensified the security of the data stored in cloud databases.

2019 ◽  
pp. 278-294
Author(s):  
Ar Arunarani ◽  
D Manjula Perkinian

Cloud databases have been used in a spate of web-based applications in recent years owing to their capacity to store big data efficiently. In such a scenario, access control techniques implemented in relational databases are so modified as to suit cloud databases. The querying features of cloud databases are designed with facilities to retrieve encrypted data. The performance with respect to retrieval and security needs further improvements to ensure a secured retrieval process. In order to provide an efficient secured retrieval mechanism, a rule- and agent-based intelligent secured retrieval model has been proposed in this paper that analyzes the user, query and contents to be retrieved so as to effect rapid retrieval with decryption from the cloud databases. The major advantage of this retrieval model is in terms of its improved query response time and enhanced security of the storage and retrieval system. From the experiments conducted in this work, proposed model increased storage and access time and, in addition, intensified the security of the data stored in cloud databases.


2017 ◽  
Vol 7 (2) ◽  
pp. 34-50 ◽  
Author(s):  
Fatiha Naouar ◽  
Lobna Hlaoua ◽  
Mohamed Nazih Omri

This paper proposes a new relevance feedback approach to collaborative information retrieval based on a confidence's network, which performs propagation relevance between annotations terms. The main contribution of our approach is to extract relevant terms to reformulate the initial user query considering the annotations as an information source. The proposed model introduces the concept of necessity that allows determining the terms that have strong association relationships. The authors estimated the association relationship to a measure of a confidence. Another contribution consists on determining the relevant annotations for a given evidence source. Since the user is over whelmed by a variety of contradictory annotations on even one which are far from the original subject, the authors' model proceed filtering these annotations to determine the relevant one and then it classify them by grouping those related semantically. The experimental study conducted on different queries gives promoters results. They show very encouraging results that could reach an improvement rate.


Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 423
Author(s):  
Márk Szalay ◽  
Péter Mátray ◽  
László Toka

The stateless cloud-native design improves the elasticity and reliability of applications running in the cloud. The design decouples the life-cycle of application states from that of application instances; states are written to and read from cloud databases, and deployed close to the application code to ensure low latency bounds on state access. However, the scalability of applications brings the well-known limitations of distributed databases, in which the states are stored. In this paper, we propose a full-fledged state layer that supports the stateless cloud application design. In order to minimize the inter-host communication due to state externalization, we propose, on the one hand, a system design jointly with a data placement algorithm that places functions’ states across the hosts of a data center. On the other hand, we design a dynamic replication module that decides the proper number of copies for each state to ensure a sweet spot in short state-access time and low network traffic. We evaluate the proposed methods across realistic scenarios. We show that our solution yields state-access delays close to the optimal, and ensures fast replica placement decisions in large-scale settings.


Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4636
Author(s):  
Mohammed Elhenawy ◽  
Mostafizur R. Komol ◽  
Mahmoud Masoud ◽  
Shiqiang Liu ◽  
Huthaifa I. Ashqar ◽  
...  

Substantial research is required to ensure that micro-mobility ride sharing provides a better fulfilment of user needs. This study proposes a novel crowdsourcing model for the ride-sharing system where light vehicles such as scooters and bikes are crowdsourced. The proposed model is expected to solve the problem of charging and maintaining a large number of light vehicles where these efforts will be the responsibility of the crowd of suppliers. The proposed model consists of three entities: suppliers, customers, and a management party responsible for receiving, renting, booking, and demand matching with offered resources. It can allow suppliers to define the location of their private e-scooters/e-bikes and the period of time they are available for rent. Using a dataset of over 9 million e-scooter trips in Austin, Texas, we ran an agent-based simulation six times using three maximum battery ranges (i.e., 35, 45, and 60 km) and different numbers of e-scooters (e.g., 50 and 100) at each origin. Computational results show that the proposed model is promising and might be advantageous to shift the charging and maintenance efforts to a crowd of suppliers.


2015 ◽  
Vol 25 (3) ◽  
pp. 471-482 ◽  
Author(s):  
Bartłomiej Śnieżyński

AbstractIn this paper we propose a strategy learning model for autonomous agents based on classification. In the literature, the most commonly used learning method in agent-based systems is reinforcement learning. In our opinion, classification can be considered a good alternative. This type of supervised learning can be used to generate a classifier that allows the agent to choose an appropriate action for execution. Experimental results show that this model can be successfully applied for strategy generation even if rewards are delayed. We compare the efficiency of the proposed model and reinforcement learning using the farmer-pest domain and configurations of various complexity. In complex environments, supervised learning can improve the performance of agents much faster that reinforcement learning. If an appropriate knowledge representation is used, the learned knowledge may be analyzed by humans, which allows tracking the learning process


2020 ◽  
Author(s):  
Wided Ali ◽  
Fatima Bouakkaz

Load-Balancing is an important problem in distributed heterogeneous systems. In this paper, an Agent-based load-balancing model is developed for implementation in a grid environment. Load balancing is realized via migration of worker agents from overloaded resources to underloaded ones. The proposed model purposes to take benefit of the multi-agent system characteristics to create an autonomous system. The Agent-based load balancing model is implemented using JADE (Java Agent Development Framework) and Alea 2 as a grid simulator. The use of MAS is discussed, concerning the solutions adopted for gathering information policy, location policy, selection policy, worker agents migration, and load balancing.


2016 ◽  
Vol 62 (1) ◽  
pp. 61-64
Author(s):  
Beata Krupanek ◽  
Ryszard Bogacz

Abstract The paper presents a new conception of building probabilistic models of communication delays in wireless networks that basis on using a delta function sequence to describe retransmissions between a transmitter and a receiver. It is assumed that the access time of the transmitter is described by a probability density function and the communication channel established in the wireless medium is disturbed by passive or active factors which cause that the transmission can be not correct and the sent data have to be retransmitted. Theoretical considerations have been verified by measurement results obtained by using the experimental system developed for investigating delays caused by external disturbances influencing the wireless transmission. A method of identification of the proposed model parameters and verification of the identified values has been presented.


Author(s):  
Yasuhiko Morimoto ◽  
Mohammad Shamsul Arefin ◽  
Mohammad Anisuzzaman Siddique
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document