From 4d421b5ba00314a00e3d929a1b7a1d33949caceb Mon Sep 17 00:00:00 2001 From: Nikolay Komarevskiy Date: Tue, 18 Feb 2025 18:35:47 +0100 Subject: [PATCH] docs: update --- .../dynamic_routing/snapshot/latency_based_routing.rs | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/ic-agent/src/agent/route_provider/dynamic_routing/snapshot/latency_based_routing.rs b/ic-agent/src/agent/route_provider/dynamic_routing/snapshot/latency_based_routing.rs index eb2497c2..a34c6d7c 100644 --- a/ic-agent/src/agent/route_provider/dynamic_routing/snapshot/latency_based_routing.rs +++ b/ic-agent/src/agent/route_provider/dynamic_routing/snapshot/latency_based_routing.rs @@ -172,11 +172,10 @@ fn compute_score( /// This module implements a routing strategy that uses weighted random selection of nodes based on their historical data (latencies and availabilities). /// The main features of this strategy are: /// -/// - Uses sliding windows for storing last N latencies and availabilities of each node -/// - The overall score of each node is computed as a product of latencies and availabilities scores, score = score_l * score_a -/// - Latency score (score_l) and availability score (score_a) are computed from sliding window using additional window_weights (exponentially decaying weights by default) to prioritize recent observations -/// - If the latest health check reveals that node is unhealthy, this node is removed from routing -/// - Uses weighted random selection for load balancing +/// - Uses sliding windows for storing latencies and availabilities of each node +/// - The overall score of each node is computed as a product of latency and availability scores, score = score_l * score_a +/// - Latency and availability scores are computed from sliding windows using an additional array of weights, allowing prioritization of more recent observations. By default, exponentially decaying weights are used. +/// - Uses weighted random selection of nodes for load balancing /// /// ## Configuration Options ///