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