Learn F5 Technologies, Get Answers & Share Community Solutions Join DevCentral

Filter by:
  • Solution
  • Technology
Answers

Algoritm for hash persistence

Hello, I found something that I´m really interested.
Looking to this forum, unRuleY (nick) said that :

I think the best approach would be to use hash persistence.

In this form of persistence, the server is always chosen based on a hash of the value provided. You would simply create a pool with the two proxy members and then in the rule specify the value you want to hash on. For example,

when HTTP_REQUEST {
persist hash [HTTP::uri]
}


Hash persistence is a little different from other persistence methods in that is uses the modulus of the hash value to determine pool member and thus bypasses load-balancing.
----------------
I´m doing the same and I think it is working.

I only want to know what algoritm F5 use to calculate HASH PERSISTENCE. I mean, I want to do the HASH VALUE of an URL and apply the modulus.

Could somebody help me ?

Thanks
Rodrigo
0
Rate this Question

Answers to this Question

placeholder+image
USER ACCEPTED ANSWER & F5 ACCEPTED ANSWER
The hash is currently a CRC32 on the string.

BTW, who's (nick)?
0
placeholder+image
USER ACCEPTED ANSWER & F5 ACCEPTED ANSWER
Thanks man.
You are the "Nick".

I just found your post in an old forum and I want to do the same.

Thanks again
Rodrigo
0
placeholder+image
USER ACCEPTED ANSWER & F5 ACCEPTED ANSWER
He was saying that your nick was unruley.

#Colin
0