matching: introduce consistent hashing matcher (#14875)
This introduces a new matcher that allows matching on an input value by computing a hash value and matching if the value % (configured value) is greater than a configured threshold. This is useful in being able to define match criteria that should match for a certain % of input values in a way that is consistent between independent Envoy instances (e.g. it does not rely on a random input). Risk Level: Low, new extension Testing: UTs Docs Changes: Inline proto docs Release Notes: n/a Platform Specific Features: n/a Fixes #14782 Signed-off-by: Snow Pettersen <snowp@lyft.com> Mirrored from https://github.com/envoyproxy/envoy @ 7fe3d358f7e7e4d4c7282d50c498a7ab0e759a36pull/624/head
parent
e99f35d4aa
commit
489c3b5b64
6 changed files with 52 additions and 0 deletions
@ -0,0 +1,9 @@ |
||||
# DO NOT EDIT. This file is generated by tools/proto_format/proto_sync.py. |
||||
|
||||
load("@envoy_api//bazel:api_build_system.bzl", "api_proto_package") |
||||
|
||||
licenses(["notice"]) # Apache 2 |
||||
|
||||
api_proto_package( |
||||
deps = ["@com_github_cncf_udpa//udpa/annotations:pkg"], |
||||
) |
@ -0,0 +1,39 @@ |
||||
syntax = "proto3"; |
||||
|
||||
package envoy.extensions.matching.input_matchers.consistent_hashing.v3; |
||||
|
||||
import "udpa/annotations/migrate.proto"; |
||||
import "udpa/annotations/status.proto"; |
||||
import "udpa/annotations/versioning.proto"; |
||||
import "validate/validate.proto"; |
||||
|
||||
option java_package = "io.envoyproxy.envoy.extensions.matching.input_matchers.consistent_hashing.v3"; |
||||
option java_outer_classname = "ConsistentHashingProto"; |
||||
option java_multiple_files = true; |
||||
option (udpa.annotations.file_status).package_version_status = ACTIVE; |
||||
|
||||
// [#protodoc-title: Consistent Hashing Matcher] |
||||
// [#extension: envoy.matching.input_matchers.consistent_hashing] |
||||
|
||||
// The consistent hashing matchers computes a consistent hash from the input and matches if the resulting hash |
||||
// is within the configured threshold. |
||||
// More specifically, this matcher evaluates to true if hash(input, seed) % modulo >= threshold. |
||||
// Note that the consistency of the match result relies on the internal hash function (xxhash) remaining |
||||
// unchanged. While this is unlikely to happen intentionally, this could cause inconsistent match results |
||||
// between deployments. |
||||
message ConsistentHashing { |
||||
// The threshold the resulting hash must be over in order for this matcher to evaluate to true. |
||||
// This value must be below the configured modulo value. |
||||
// Setting this to 0 is equivalent to this matcher always matching. |
||||
uint32 threshold = 1; |
||||
|
||||
// The value to use for the modulus in the calculation. This effectively bounds the hash output, |
||||
// specifying the range of possible values. |
||||
// This value must be above the configured threshold. |
||||
uint32 modulo = 2 [(validate.rules).uint32 = {gt: 0}]; |
||||
|
||||
// Optional seed passed through the hash function. This allows using additional information when computing |
||||
// the hash value: by changing the seed value, a different partition of matching and non-matching inputs will |
||||
// be created that remains consistent for that seed value. |
||||
uint64 seed = 3; |
||||
} |
Loading…
Reference in new issue