Yun Tian and Xiao Qin
Computer Science and Software Engineering Department Auburn University Auburn, AL 36849
Yun Tian and Xiao Qin Computer Science and Software Engineering - - PowerPoint PPT Presentation
Yun Tian and Xiao Qin Computer Science and Software Engineering Department Auburn University Auburn, AL 36849 Large-scale data processing Scalability, availability, performance, security 2 8/22/2011 Security is achieved at the
Yun Tian and Xiao Qin
Computer Science and Software Engineering Department Auburn University Auburn, AL 36849
8/22/2011 2
Large-scale data processing Scalability, availability, performance, security
8/22/2011 3
Security is achieved at the cost
performance degradation
P S
Security Overheads
S P
(m, n) Secret sharing - e.g., (2, 3) File Fragmentation
8/22/2011 4
Motivation: Storage nodes in a distributed system have heterogeneous vulnerabilities.
A wide variety of:
Heterogeneities affect performance
8/22/2011 5
Can we leverage heterogeneity features to improve security for distributed systems?
8/22/2011 6
Fragment a
a
F
Fragment b Fragment c
File F has 3 fragments: a, b, c F(i)= j mod n
8/22/2011 7
Problem?
Fragment a Fragment b Fragment c
Reconstruct
File F
8/22/2011 8 8/22/2011 8
The Architecture of a Cluster
Client
Network switch Computing nodes
Storage subsystems (or Storage Area Network) Internet
Head Node
8/22/2011 9
8/22/2011 10
R
R1 Rk
f1 fk Reconstruct
File F
different server groups as possible
to improve I/O performance
8/22/2011 11
Diversity make sense?
different “server type” based on their different security level or strategy caused by hardware or software;
8/22/2011 12
Store fragments of a file across as many different
server-type groups as possible
8/22/2011 13
Allocate file fragments to improve I/O
storage clusters can degrade performance.
fragments to storage nodes within a cluster.
8/22/2011 14
8/22/2011 15
Fragmentation technique Heterogeneous Natures Secret sharing scheme(m n)
To improve the assurance level
8/22/2011 16
8/22/2011 17
Static Dynamic
8/22/2011 18
8/22/2011 19
We gradually increase system size from 45 to 70 by increments of 5, keep k at 3,and also vary m from 4 to 8.
8/22/2011 20
8/22/2011 21
8/22/2011 22
8/22/2011 23
Heterogeneous vulnerability: storage nodes are
classified into different server groups based upon their vulnerabilities
S-FAS : a secure fragmentation allocation scheme Storage assurance and dynamic assurance models A prototype in which S-FAS was implemented
8/22/2011 24
8/22/2011 25
Consider data replications to enhance reliability and
performance
Authorization/Authentication mechanisms in the
prototype.
Encryption/Decryption Mechanisms in the
prototype.
Google: slideshare Xiao Qin
‹#›
8/22/2011 30
8/22/2011 31