Raúl Kripalani 35444fbc6a implement two-tiered lookahead-based GC procedure.
The GC procedure consists of two tiers: lookahead and purge. The
lookahead tier runs less frequently (default 12 hours) than the purge
tier (default 5 minutes).

A lookahead round traverses the entire store and picks entries that
need to be visited in the current lookahead window, pinning those
entries in a separate region in the KV store, indexed by the next visit
timestamp.

A purge round iterates over the lookahead window only, and refreshes
the entries that require a visit. It removes them from the lookahead
region unless the entry requires another visit within the current
window.
2018-11-28 00:13:02 +00:00
2018-11-09 15:31:38 -08:00
2018-09-07 12:43:27 +01:00
2018-11-15 13:40:48 +00:00
2018-11-07 15:48:31 +10:00
2018-09-02 12:10:55 +01:00
2018-11-07 15:48:31 +10:00
2016-08-19 15:01:56 -07:00
2018-11-02 15:49:58 -07:00
2016-04-15 20:21:56 -07:00
2016-10-04 18:01:51 -07:00
2018-09-02 12:10:55 +01:00
2018-09-02 12:10:55 +01:00
2018-11-16 11:11:00 +00:00
2018-11-09 11:13:06 +08:00
2018-09-07 18:46:23 +01:00
2018-09-27 20:59:57 +01:00

go-libp2p-peerstore

GoDoc Coverage Status Build Status

An object to manage peers, their addresses, and other metadata about them.

Install

go get github.com/libp2p/go-libp2p-peerstore

Usage

Check out the GoDocs.

Contribute

Feel free to join in. All welcome. Open an issue!

This repository falls under the IPFS Code of Conduct.

Want to hack on IPFS?

License

MIT

Description
an object to manage sets of peers, their addresses and other metadata
Readme MIT 1 MiB
Languages
Go 100%