loading...
Placement in Dependable and Secure Peer-to-Peer Data Grids
Dallas, Texas, USA November 14-November 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HASE.2007.5110th IEEE High Assurance Systems Engi ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In this paper, we consider combining replication and data partitioning schemes to assure data availability, confidentiality, and timely accesses for data grid applications. Data objects are partitioned into shares and shares and dispersed. The shares may be replicated to achieve better performance and availability. We develop models for assessing confidentiality, availability, and communication cost for different placements and use the metrics to guide placement decisions. A new probabilistic security assurance model and an efficient availability computing algorithm have been developed. Due to the nature of contradicting goals, we model the placement decision problem as a multi-objective problem and use a genetic algorithm to determine Pareto optimal placement solutions.
Citation:
Manghui Tu, Liangliang Xiao, Hui Ma, I-Ling Yen, Farokh Bastani, "Placement in Dependable and Secure Peer-to-Peer Data Grids," hase, pp.133-140, 10th IEEE High Assurance Systems Engineering Symposium (HASE'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.