Forum Discussion
dragonflymr
Cirrostratus
Feb 13, 2015Hash based persistence - how it works
Hi,
I did read every document and discussion about it and still don't get the idea how it works. Probably that is so obvious for pros that nobody cared to explain it in plain English.
What ...
StephanManthey
Nacreous
Feb 13, 2015Hi Piotr,
what you are describing is the CARP option (Cache Array Routing Protocol).
Yes, hash based score will be calculated for each pool member. Highest one wins.
If it goes down, second best will be selected and so on.
With CARP no persistence table will be used. So it scales pretty well if you need to persist i.e. on millions of keys.
But it takes more CPU cycles to calculate.
Traditional hash just calculates a modulus. A change in number of pool members will cause complete redistribution.
CARP based method will result in very little redistribution if a pool members are added or removed.
Thanks, Stephan
Help guide the future of your DevCentral Community!
What tools do you use to collaborate? (1min - anonymous)Recent Discussions
Related Content
DevCentral Quicklinks
* Getting Started on DevCentral
* Community Guidelines
* Community Terms of Use / EULA
* Community Ranking Explained
* Community Resources
* Contact the DevCentral Team
* Update MFA on account.f5.com
Discover DevCentral Connects