Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update loadbalance.md #128

Merged
merged 1 commit into from
Jul 12, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 2 additions & 3 deletions docs/tutorials/service-governance/loadbalance.md
Original file line number Diff line number Diff line change
Expand Up @@ -39,9 +39,8 @@ P2C算法是一种改进的随机算法,它可以避免最劣选择和负载

具体来说,P2C算法的实现步骤如下:

1. 将所有可用节点按照负载大小排序,从小到大排列。
2. 随机选择两个节点。
3. 选择两个节点中负载较小的节点,作为负载均衡器选择的节点。
1. 随机选择两个节点。
2. 通过指数加权移动平均算法统计服务端的实时状态,从而做出最优选择,作为负载均衡器最后的结果。
P2C算法的优点在于,它可以在保证负载均衡的前提下,选择负载更小的节点,从而提高系统的性能和可靠性。此外,P2C算法的实现简单,不需要太多的计算和存储资源,因此在实际应用中被广泛采用。

***小结***
Expand Down
Loading