Dan Cristian Marinescu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dan Cristian Marinescu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- John Patrick Morrison
University College Cork
6 shared publications - Ashkan Paya
Computer Science Division Department of Electrical Engineering and Computer Science University of Central Florida 32816 Orlando FL USA
5 shared publications - Chen Yu
University of Central Florida
2 shared publications - Philip Healy
Irish Centre for Cloud Computing & Commerce Dublin Ireland
2 shared publications - Timothy S Baker
Department of Biological Sciences, Purdue University, West Lafayette, IN 47907, USA
2 shared publications - Wei Zhang
College of Animal Science and Technology, Henan Agricultural University
2 shared publications
Latest Publications
- 18 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 5 (2) , 192-203
Information Leakage in Cloud Data Warehouses
Information leakage is the inadverent disclosure of sensitive information through correlation of records from several databases/collections of a cloud data warehouse. Malicious insiders pose a serious threat to cloud data security and this justifies the focus on information leakage due to rogue employees or to outsiders using the credentials of legitimate employees. The discussion in this paper is restricted to NoSQL databases with a flexible schema. Data encryption can reduce information leakage, but it is impractical to encrypt large databases and/or all fields of database documents. Encryption limits the operations that can be carried on the data in a database. It is thus, critical to distinguish sensitive documents in a data warehouse and concentrate on efforts to protect them. The capacity of a leakage channel introduced in this work quantifies the intuitively obvious means to trigger alarms when an insider attacker uses excessive computer resources to correlate information in multiple databases. The Sensitivity Analysis based on Data Sampling (SADS) introduced in this paper balances the trade-offs between higher efficiency in identifying the risks posed by information leakage and the accuracy of the results obtained by sampling very large collections of documents. The paper reports on experiments assessing the effectiveness of SADS and the use of selective disinformation to limit information leakage. Cloud services identifying sensitive records and reducing the risk of information leakage are also discussed.
- 18 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 5 (2) , 192-203
Information Leakage in Cloud Data Warehouses
Information leakage is the inadverent disclosure of sensitive information through correlation of records from several databases/collections of a cloud data warehouse. Malicious insiders pose a serious threat to cloud data security and this justifies the focus on information leakage due to rogue employees or to outsiders using the credentials of legitimate employees. The discussion in this paper is restricted to NoSQL databases with a flexible schema. Data encryption can reduce information leakage, but it is impractical to encrypt large databases and/or all fields of database documents. Encryption limits the operations that can be carried on the data in a database. It is thus, critical to distinguish sensitive documents in a data warehouse and concentrate on efforts to protect them. The capacity of a leakage channel introduced in this work quantifies the intuitively obvious means to trigger alarms when an insider attacker uses excessive computer resources to correlate information in multiple databases. The Sensitivity Analysis based on Data Sampling (SADS) introduced in this paper balances the trade-offs between higher efficiency in identifying the risks posed by information leakage and the accuracy of the results obtained by sampling very large collections of documents. The paper reports on experiments assessing the effectiveness of SADS and the use of selective disinformation to limit information leakage. Cloud services identifying sensitive records and reducing the risk of information leakage are also discussed.
- 27 January 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (1) , 909-924
An approach for scaling cloud resource management
- 27 January 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (1) , 909-924
An approach for scaling cloud resource management
- Open Access
Energy-aware Load Balancing Policies for the Cloud Ecosystem
The energy consumption of computer and communication systems does not scale linearly with the workload. A system uses a significant amount of energy even when idle or lightly loaded. A widely reported solution to resource management in large data centers is to concentrate the load on a subset of servers and, whenever possible, switch the rest of the servers to one of the possible sleep states. We propose a reformulation of the traditional concept of load balancing aiming to optimize the energy consumption of a large-scale system: {\it distribute the workload evenly to the smallest set of servers operating at an optimal energy level, while observing QoS constraints, such as the response time.} Our model applies to clustered systems; the model also requires that the demand for system resources to increase at a bounded rate in each reallocation interval. In this paper we report the VM migration costs for application scaling.
Open AccessEnergy-aware Load Balancing Policies for the Cloud Ecosystem
The energy consumption of computer and communication systems does not scale linearly with the workload. A system uses a significant amount of energy even when idle or lightly loaded. A widely reported solution to resource management in large data centers is to concentrate the load on a subset of servers and, whenever possible, switch the rest of the servers to one of the possible sleep states. We propose a reformulation of the traditional concept of load balancing aiming to optimize the energy consumption of a large-scale system: {\it distribute the workload evenly to the smallest set of servers operating at an optimal energy level, while observing QoS constraints, such as the response time.} Our model applies to clustered systems; the model also requires that the demand for system resources to increase at a bounded rate in each reallocation interval. In this paper we report the VM migration costs for application scaling.
- Open Access
Bid-Centric Cloud Service Provisioning
Bid-centric service descriptions have the potential to offer a new cloud service provisioning model that promotes portability, diversity of choice and differentiation between providers. A bid matching model based on requirements and capabilities is presented that provides the basis for such an approach. In order to facilitate the bidding process, tenders should be specified as abstractly as possible so that the solution space is not needlessly restricted. To this end, we describe how partial TOSCA service descriptions allow for a range of diverse solutions to be proposed by multiple providers in response to tenders. Rather than adopting a lowest common denominator approach, true portability should allow for the relative strengths and differentiating features of cloud service providers to be applied to bids. With this in mind, we describe how TOSCA service descriptions could be augmented with additional information in order to facilitate heterogeneity in proposed solutions, such as the use of coprocessors and provider-specific services.
Open AccessBid-Centric Cloud Service Provisioning
Bid-centric service descriptions have the potential to offer a new cloud service provisioning model that promotes portability, diversity of choice and differentiation between providers. A bid matching model based on requirements and capabilities is presented that provides the basis for such an approach. In order to facilitate the bidding process, tenders should be specified as abstractly as possible so that the solution space is not needlessly restricted. To this end, we describe how partial TOSCA service descriptions allow for a range of diverse solutions to be proposed by multiple providers in response to tenders. Rather than adopting a lowest common denominator approach, true portability should allow for the relative strengths and differentiating features of cloud service providers to be applied to bids. With this in mind, we describe how TOSCA service descriptions could be augmented with additional information in order to facilitate heterogeneity in proposed solutions, such as the use of coprocessors and provider-specific services.
- Open Access
An Auction-driven Self-organizing Cloud Delivery Model
The three traditional cloud delivery models -- IaaS, PaaS, and SaaS -- constrain access to cloud resources by hiding their raw functionality and forcing us to use them indirectly via a restricted set of actions. Can we introduce a new delivery model, and, at the same time, support improved security, a higher degree of assurance, find relatively simple solutions to the hard cloud resource management problems, eliminate some of the inefficiencies related to resource virtualization, allow the assembly of clouds of clouds, and, last but not least, minimize the number of interoperability standards? We sketch a self-organizing architecture for very large compute clouds composed of many-core processors and heterogeneous coprocessors. We discuss how self-organization will address each of the challenges described above. The approach is {\em bid-centric}. The system of heterogeneous cloud resources is dynamically, and autonomically, configured to bid to meet the needs identified in a high-level task or service specification. When the task is completed, or the service is retired, the resources are released for subsequent reuse. Our approach mimics the process followed by individual researchers who, in response to a call for proposals released by a funding agency, organize themselves in groups of various sizes and specialities. If the bid is successful, then the group carries out the proposed work and releases the results. After the work is completed, individual researchers in the group disperse, possibly joining other groups or submitting individual bids in response to other proposals. Similar protocols are common to other human activities such as procurement management.
Open AccessAn Auction-driven Self-organizing Cloud Delivery Model
The three traditional cloud delivery models -- IaaS, PaaS, and SaaS -- constrain access to cloud resources by hiding their raw functionality and forcing us to use them indirectly via a restricted set of actions. Can we introduce a new delivery model, and, at the same time, support improved security, a higher degree of assurance, find relatively simple solutions to the hard cloud resource management problems, eliminate some of the inefficiencies related to resource virtualization, allow the assembly of clouds of clouds, and, last but not least, minimize the number of interoperability standards? We sketch a self-organizing architecture for very large compute clouds composed of many-core processors and heterogeneous coprocessors. We discuss how self-organization will address each of the challenges described above. The approach is {\em bid-centric}. The system of heterogeneous cloud resources is dynamically, and autonomically, configured to bid to meet the needs identified in a high-level task or service specification. When the task is completed, or the service is retired, the resources are released for subsequent reuse. Our approach mimics the process followed by individual researchers who, in response to a call for proposals released by a funding agency, organize themselves in groups of various sizes and specialities. If the bid is successful, then the group carries out the proposed work and releases the results. After the work is completed, individual researchers in the group disperse, possibly joining other groups or submitting individual bids in response to other proposals. Similar protocols are common to other human activities such as procurement management.
- Open Access
Energy-aware Application Scaling on a Cloud
Cloud elasticity - the ability to use as much resources as needed at any given time - and low cost - a user pays only for the resources it consumes - represent solid incentives for many organizations to migrate some of their computational activities to a public cloud. As the interest in cloud computing grows, so does the size of the cloud computing centers and their energy footprint. The realization that power consumption of cloud computing centers is significant and it is expected to increase substantially in the future motivates our interest in scheduling and scaling algorithms which minimize power consumption. We propose energy-aware application scaling and resource management algorithms. Though targeting primarily the Infrastructure as a Service (IaaS), the system models and the algorithms we propose can be applied to the other cloud delivery models and to private clouds.
Open AccessEnergy-aware Application Scaling on a Cloud
Cloud elasticity - the ability to use as much resources as needed at any given time - and low cost - a user pays only for the resources it consumes - represent solid incentives for many organizations to migrate some of their computational activities to a public cloud. As the interest in cloud computing grows, so does the size of the cloud computing centers and their energy footprint. The realization that power consumption of cloud computing centers is significant and it is expected to increase substantially in the future motivates our interest in scheduling and scaling algorithms which minimize power consumption. We propose energy-aware application scaling and resource management algorithms. Though targeting primarily the Infrastructure as a Service (IaaS), the system models and the algorithms we propose can be applied to the other cloud delivery models and to private clouds.
- 2 September 2009
- Published by Springer Nature in Journal of Grid Computing
- Vol. 8 (1) , 133-155
Algorithms for Divisible Load Scheduling of Data-intensive Applications
- 2 September 2009
- Published by Springer Nature in Journal of Grid Computing
- Vol. 8 (1) , 133-155
Algorithms for Divisible Load Scheduling of Data-intensive Applications
- 7 July 2007
- Published by Springer Nature in Quantum Information Processing
- Vol. 6 (4) , 273-293
Quantum Error Correction of Time-correlated Errors
- 7 July 2007
- Published by Springer Nature in Quantum Information Processing
- Vol. 6 (4) , 273-293
Quantum Error Correction of Time-correlated Errors