> > Can anybody give me an idea of what people are using for P2P set
> > reconciliation these days? Or have other techniques like rateless
> > erasure codes pretty much eliminated the need for set reconciliation?
> >
> > I'm looking at using Characteristic Polynomial Interpolation to do
> > set reconciliation in a distributed system, I have a couple
> > questions about it but I'm not sure if it's worth pursuing, or if
> > the community has found better alternatives.
While you have not described the application scenario, I believe Yaron
Minsky's thesis work is still the state of the art in set reconciliation
and is practical enough for use. This paper explains the core idea:
Yaron Minsky, Ari Trachtenberg, Richard Zippel: Set
reconciliation with nearly optimal communication complexity.
IEEE Transactions on Information Theory 49(9): 2213-2218 (2003).
This is a Cornell thesis; let me know if you need a copy, though,
logistically, contacting Yaron should be much easier and faster.
- egs
_______________________________________________
p2p-hackers mailing list
p2p-hackers@lists.zooko.com
http://lists.zooko.com/mailman/listinfo/p2p-hackers
