periodic checking and maintenance of cache invariance #30

New issue

Closed

opened 2020-06-02 23:25:24 +02:00 by schmittlauch · 0 comments

schmittlauch commented

2020-06-02 23:25:24 +02:00

Owner

Periodically check logarithmic EpiChord cache slice whether they contain at least j entries per slice. If needed, look up new node entries.

A first implementation has been made in Hash2Pub.FediChordTypes.checkCacheSlices

Periodically check logarithmic EpiChord cache slice whether they contain at least j entries per slice. If needed, look up new node entries. A first implementation has been made in Hash2Pub.FediChordTypes.checkCacheSlices

schmittlauch added this to the working EpiChord overlay (without k-choices) milestone 2020-06-02 23:25:24 +02:00

schmittlauch added the

basic functionality

DHT

labels 2020-06-02 23:25:24 +02:00

schmittlauch referenced this issue from a commit

2020-06-27 16:23:53 +02:00

Refactor requestQueryID to be able to send a single request in preparation for #30

schmittlauch referenced this issue from a commit

2020-06-27 16:23:53 +02:00

check cache invariant for successors and lookup missing IDs first half of #30

schmittlauch referenced this issue from a commit

2020-06-27 16:23:54 +02:00

check cache slice invariant for predecessor slices as well closes #30 \0/

schmittlauch closed this issue

2020-06-27 16:24:12 +02:00

No labels

No milestone

No project

No assignees

1 participant

Notifications

Due date

The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference: schmittlauch/Hash2Pub#30

No description provided.