|
From: Yonik S. <yo...@ap...> - 2008-02-29 14:08:38
|
On Thu, Feb 28, 2008 at 5:37 PM, Doug Cutting <cu...@ap...> wrote: > I'd imagined each node periodically querying its neighbors for changes > in the range they share. We shouldn't rely on clock synchronization, so > each node would keep the last revision of each neighbor that it has > sync'd with. So, the first time they connect, they pass revision zero > and receive all updates for their overlap. The next time they only need > to retrieve updates since the last. Sounds good! We'll need to make sure that it handles this case: Say C syncs from B, then B syncs from A and get some new docs. Now A goes away for a while... it seems like C will need to get the new docs from B next time it syncs. If the docs that B got from A are treated like any other new additions, this should work right? -Yonik |