Folklore provides persistent and untraceable distributed object storage through endemic migratory replication. Periodic random interactions among asynchronous processes, achieves a stable number of replicas, S, with high probability, after the system converges. The protocol has the ability to converge back to S replicas, even if only a single replica is available.

Data-Untraceability is a core Folklore property. The location of all replicas of an object can't be determined. Surprisingly, efficient object retrieval and update features are implemented without losing untraceability. Folklore is currently implemented in C language, as a thread safe library.

News

2005-12-10: Website is up.

Publications

  • Ramsés Morales and Indranil Gupta. "Providing Both Scale and Security through a Single Core Probabilistic Protocol". To appear in StoDiS 2005 - Workshop on Stochasticity in Distributed Systems, 2005. [PDF]
  • Indranil Gupta. "On the Design of Distributed Protocols from Differential Equations," Proc. 23rd Conf. Principles of Distributed Computing (PODC), 2004. [PDF]

People

This project is part of the Distributed Protocols Research Group (DPRG). We are part of the Computer Science Department of the University of Illinois at Urbana Champaign.

Faculty:

  • Dr. Indranil Gupta is assistant professor in the Computer Science Department, and founder of DPRG.

Graduate Students:

Download

The code is currenlty undergoing a major clean-up. Send us an email if you are interested.