Preserving social locality in data replication for online social networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2011, Pages 129-133

  Nguyen, Khanh ^a   Pham, Cuong ^a   Tran, Duc A ^a   Zhang, Feng ^b  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

^b India Center of Excellence   (United States)

Author keywords

data storage; replication; social locality; Social networks

Indexed keywords

DATA REPLICATION; DATA STORAGE; ONLINE SOCIAL NETWORKS; REPLICATION; REPLICATION METHOD; SOCIAL LOCALITY; SOCIAL NETWORKS; SOCIAL RELATIONSHIPS; SYSTEM EFFICIENCY; USER DATA;

ONLINE SYSTEMS; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80052406065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2011.14     Document Type: Conference Paper

References (13)

1. P. L. Reiher, J. S. Heidemann, D. Ratner, G. Skinner, and G. J. Popek, "Resolving file conflicts in the ficus file system," in USENIX Technical Conference, 1994, pp. 183-195.
2. M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel, and D. C. Steere, "Coda: A highly available file system for a distributed workstation environment," IEEE Trans. Comput., vol. 39, pp. 447-459, April 1990.
3. S. Ghemawat, H. Gobioff, and S.-T. Leung, "The google file system," SIGOPS Oper. Syst. Rev., vol. 37, October 2003.
4. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer, "Farsite: federated, available, and reliable storage for an incompletely trusted environment," in Proceedings of the 5th symposium on Operating systems design and implementation, ser. OSDI '02. New York, NY, USA: ACM, 2002, pp. 1-14.
5. D. B. Terry, M. M. Theimer, K. Petersen, A. J. Demers, M. J. Spreitzer, and C. H. Hauser, "Managing update conflicts in bayou, a weakly connected replicated storage system," SIGOPS Oper. Syst. Rev., vol. 29, pp. 172-182, December 1995.
6. A. Lakshman and P. Malik, "Cassandra: a decentralized structured storage system," SIGOPS Oper. Syst. Rev., vol. 44, pp. 35-40, April 2010.
7. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber, "Bigtable: a distributed storage system for structured data," in Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7, Berkeley, CA, USA, 2006, pp. 15-15.
8. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, "Dynamo: amazon's highly available key-value store," SIGOPS Oper. Syst. Rev., vol. 41, pp. 205-220, October 2007.
9. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, "Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web," in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, ser. STOC '97. New York, NY, USA: ACM, 1997, pp. 654-663.
10. J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez, "The little engine(s) that could: scaling online social networks," in Proceedings of the ACM SIGCOMM 2010 Conference. New York, NY, USA: ACM, 2010, pp. 375-386.
11. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the evolution of user interaction in facebook," Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks, 2009.
12. A. L. Barab́asi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
13. A. Clauset, M. E. J. Newman, , and C. Moore, "Finding community structure in very large networks," Physical Review E, pp. 1- 6, 2004.