Journal:Informatica
Volume 35, Issue 3 (2024), pp. 649–669
Abstract
The growing popularity of mobile and cloud computing raises new challenges related to energy efficiency. This work evaluates four various SQL and NoSQL database solutions in terms of energy efficiency. Namely, Cassandra, MongoDB, Redis, and MySQL are taken into consideration. This study measures energy efficiency of the chosen data storage solutions on a selected set of physical and virtual computing nodes by leveraging Intel RAPL (Running Average Power Limit) technology. Various database usage scenarios are considered in this evaluation including both local usage and remote offloading. Different workloads are benchmarked through the use of YCSB (Yahoo! Cloud Serving Benchmark) tool. Extensive experimental results show that (i) Redis and MongoDB are more efficient in energy consumption under most usage scenarios, (ii) remote offloading saves energy if the network latency is low and destination CPU is significantly more powerful, and (iii) computationally weaker CPUs may sometimes demonstrate higher energy efficiency in terms of J/ops. An energy efficiency measurement framework is proposed in order to evaluate and compare different database solutions based on the obtained experimental results.
Pub. online:1 Jan 2017Type:Research ArticleOpen Access
Journal:Informatica
Volume 28, Issue 1 (2017), pp. 193–214
Abstract
To provide better overall performance, identity (ID)-based signcryption (IBSC) has been constructed by combining ID-based signature (IBS) and ID-based encryption (IBE) in a secure manner. Undoubtedly, the IBSC fulfills the authentication and the confidentiality by signature and encryption, respectively. All the previously proposed IBSC schemes are inseparable in the sense that the two-layer sign-then-encrypt procedure must be performed only by the same entity. However, the entities, such as wireless sensors and smart cards, are resource-constrained and become time consuming in executing the two-layer sign-then-encrypt procedure. Nowadays, the usage of mobile cloud computing is gaining expanding interest which provides scalable and virtualized services over the Internet or wireless networks while users with resource-constrained devices can enjoy the advantages of mobile cloud computing environments. Hence, we aim to reduce the computational cost for resource-constrained devices by employing a third party. In this article, we present the first separable ID-based signcryption (SIBSC) scheme in which the signing and encrypting layers are performed by the device and a third party, respectively. Under the computation Diffie–Hellman (CDH) and bilinear Diffie–Hellman (BDH) assumptions, we demonstrate that the proposed SIBSC scheme offers the provable security of authentication and confidentiality while retaining communication performance.
Journal:Informatica
Volume 26, Issue 2 (2015), pp. 181–198
Abstract
Abstract
This paper proposes an access control mechanism of verifiable cloud computing services using chameleon hashing and Diffie–Hellman key exchange protocol. By this mechanism, an entity can apply for cloud computing services and he can authorize other users to access granted data or services. When an authorized user or entity wants to access cloud computing services, he can authenticate the cloud computing service provider. Moreover, no entity secret will be revealed by data kept by cloud servers such that security and cost saving can be both ensured. Security proof under the simulation paradigm is also given.
Journal:Informatica
Volume 26, Issue 1 (2015), pp. 159–180
Abstract
Abstract
Traditional researches on scheduling of cloud workflow applications were mainly focused on time and cost. However, security and reliability have become the key factors of cloud workflow scheduling. Taking time, cost, security and reliability into account, we present a trust-based scheduling strategy. We firstly formulate the cloud workflow scheduling and then propose the corresponding algorithm, in which the trustful computation service and storage service are selected according to the set-based particle swarm optimization (S-PSO) method and set covering problem (SCP) tree search heuristic method, respectively. Finally, experimental results show that, compared with traditional methods, the proposed algorithm has better performance.
Journal:Informatica
Volume 26, Issue 1 (2015), pp. 135–157
Abstract
Abstract
P2P systems enable decentralised applications for supporting collaborating groups and communities, where the collaboration may involve both sharing of data and sharing of group processes among group members. In such applications, monitoring and awareness are critical functionalities required for an effective collaboration. However, to date there has been little research into providing generic, application-independent awareness in P2P groupware systems. We present a distributed event-based awareness approach for such systems that provides different forms of awareness through a set of interoperating, low-level awareness services. The user and technical requirements for the approach are motivated with reference to Project-Based Learning in a P2P environment. We describe the implementation of a superpeer P2P network on a Cloud platform and the provision of reliable awareness services (AaaS – Awareness as a Service) from the Cloud. We report on the outcomes of an empirical evaluation of the performance and scalability of the approach.
Journal:Informatica
Volume 24, Issue 3 (2013), pp. 381–394
Abstract
While users increasingly use such large multimedia data, more people use the cloud computing technology. It is necessary to manage large data in an efficient way, and to consider transmission efficiency for multimedia data of different quality. To this end, an important thing is to ensure efficient distribution of important resources (CPU, network and storage) which constitute cloud computing, and variable distribution algorithms are required therefor. This study proposes a method of designing a scheme for applying MapReduce of the FP-Growth algorithm which is one of data mining methods based on the Hadoop platform at the stage of IaaS (Infrastructure As a Service) including CPU, networking and storages. The method is then for allocating resources with the scheme.
Journal:Informatica
Volume 24, Issue 3 (2013), pp. 357–380
Abstract
This study proposes a model for supporting the decision making process of the cloud policy for the deployment of virtual machines in cloud environments. We explore two configurations, the static case in which virtual machines are generated according to the cloud orchestration, and the dynamic case in which virtual machines are reactively adapted according to the job submissions, using migration, for optimizing performance time metrics. We integrate both solutions in the same simulator for measuring the performance of various combinations of virtual machines, jobs and hosts in terms of the average execution and total simulation time. We conclude that the dynamic configuration is prosperus as it offers optimized job execution performance.