|0.1.1||Aug 19, 2022|
|0.1.0||Aug 4, 2021|
#437 in Concurrency
tagged-rendezvous is a toy crate for implementing rendezvous hashing with
the ability to exclude certain nodes based on a generic discriminant. This
crate utilizes the algorithm described in
Schindelhauer and Schomaker "Weighted Distributed Hash Tables" to
provide perfect stability and weight precision in the presence of mutations.
The intended use case of this crate is to provide an ergonomic way to load-balance to potentially weighted nodes for some arbitrary input, while allowing large networks to respect geopolitical issues that often occur with global networks. In other words, it allows for nodes to provide a discriminant to exclude themselves from being selected given the need to load balance some content that may be ethically, morally, or legally impermissible.
This is useful in multiple contexts. For example, a basic CDN architecture may use this to distribute multiple nodes across multiple countries and ensure that some content will not appear in nodes where the content is considered illegal. Another example would be in scenarios of volunteer nodes for some CDN to support some network as a whole but refuse to serve certain content that is illegal in their country or content they morally object to.
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
SPDX-License-Identifier: MIT OR Apache-2.0