On the optimal placement of secure data objects over internet

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages 14-

  Tu, Manghui ^a   Li, Peng ^a   Ma, Qingkai ^a   Yen, I Ling ^a   Bastani, Farokh B ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT ACCESS PATTERNS; DYNAMIC REPLICATION; MULTIPLE CLUSTERS; SECRET SHARING SCHEMES;

ALGORITHMS; COST EFFECTIVENESS; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; INFORMATION RETRIEVAL SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; TOPOLOGY;

INTERNET;

EID: 33746311037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.306     Document Type: Conference Paper

References (22)

1. [Agr97] D. Agrawal, et. al. "Epidemic algorithms in replicated databases " In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 1997.
2. [Des91] Y. Deswarte, et. al. "Intrusion tolerance in distributed computing systems. IEEE Symposium on Research in Security and Privacy. 1991.
3. [Gen95] R. Gennaro. "Theory and practice of verifiable secret sharing," Ph.D-thesis, MIT, 1995.
4. [Gra96] J. Gray, et. al. "The dangers of replication and a solution". ACM SIGMOD Conference, 1996.
5. [Hai01] J. W. Haines, et. al. "Extending the DARPA off-line intrusion detection evaluations," DARPA Information Survivability Conference & Exposition, Vol. 1,2001.
6. [Jia01] X. Jia, et. al. "Placement of read-write proxies in the Internet," In proceedings ICDCS 2001.
7. [Jin00] C. Jin, et. Al. "Inet: Internet Topology Generator," Tech. Rep. CSE-TR-433-00, EECS Department, University of Michigan, 2000
8. [Kal01] K. K. Kalpakis, et. al. "Optimal placement of replicas in trees with read, write, and storage costs," IEEE Transactions on Parallel and Distributed Systems. Vol 12, No. 6. 2001.
9. [Kar79] O. Kariv and S.L. Hakimi, "An Algorithmic Approach to Location Problems II: The p-Medians," SIAM J. Applied Math.. Vol. 37, No. 3. 1979.
10. [Kew01] D.L. Kewley and J.F. Bouchard, "DARPA Information Assurance Program dynamic defense experiment summary," IEEE Trans. Systems, Man and Cybernetics, Vol. 31, No. 4, 2000.
11. [Kia01] M. Y. Kiang, "Extending the Kohonen self-organizing map networks for clustering analysis," Elsevier Computational Statistics & Data Analysis 38 (2001)
12. [Lad92] R. Ladin, et. al. "Providing high availability using lazy replication", ACM Transactions. 1992
13. [Lak03] S. Lakshmanan, et. al. "Responsive Security for stored Data"IEEE Transactions on Parallel and Distributed systems. Vol 14, No. 9, 2003.
14. [Mal00] M. Malkin, et. al. Building intrusion tolerant applications. DARPA Information Survivability Conference & Exposition I. 2000.
15. [Mei03] A. Mei, et. al. "Secure dynamic fragment and replica allocation in large-scale distributed File systems". IEEE Transactions on Parallel and Distributed systems. Vol 14, No. 9, 2003.
16. [Sha79] A. Shamir. "How to share a secret," Communication of the ACM. Vol. 22, 1979.
17. [Thu99] B.M. Thuraisingham and J.A. Maurer, "Information survivability for evolvable and adaptable real-time command and control systems," IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No. 1, 1999.
18. [Tu04a] M. Tu, et. al. "Transaction based dynamic partial replication in mobile environments". Proceeding s in IPDPS'04. 2004
19. [Tu04b] M. Tu, et. al. "On the optimal placement of secure data over internet". TR-UTDCS 36-04. 2004
20. [VA00] J. Vesanto and E. Alhoniemi, "Clustering of the Self-Organizing Map," the IEEE Transactions on Neural Networks, Vol. 11, No. 3, May 2000.
21. [Wol91] O. Wolfson and A. Milo. "The Multicast Policy and Its Relationship to Replicated Data Placement," ACM Trans. Database Systems. Vol. 16, No. 1. 1991.
22. [Wol97] O. Wolfson, S. Jajodia and Y. Huang. An adaptive data replication algorithm. ACM Transactions on database systems. Vol. 22. No. 2 pages 255-314. 1997.