Re: Faster hashing for DHT

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Jeff Darcy wrote:
On 01/05/2010 07:56 PM, Martin Fick wrote:
Hmm, if it were collision resistant, wouldn't that mean that you would need one server for each file you want to store?  I suspect you want many collisions, just a good even distribution of those collisions,

"Collision resistance" in this context usually refers to avoidance of
*spurious* collisions - i.e. those above the level that would occur with
an ideal distribution - so "even distribution" is a good summary of its
practical effect.

Hmmm ... I have an interest in trying out alternative hashing schemes, specifically ones that give a good distribution over large numbers of bricks.

Mebbe I'll look at that code if I get the chance ...

--
Joseph Landman, Ph.D
Founder and CEO
Scalable Informatics Inc.
email: landman@xxxxxxxxxxxxxxxxxxxxxxx
web  : http://scalableinformatics.com
       http://scalableinformatics.com/jackrabbit
phone: +1 734 786 8423 x121
fax  : +1 866 888 3112
cell : +1 734 612 4615




[Index of Archives]     [Gluster Users]     [Ceph Users]     [Linux ARM Kernel]     [Linux ARM]     [Linux Omap]     [Fedora ARM]     [IETF Annouce]     [Security]     [Bugtraq]     [Linux]     [Linux OMAP]     [Linux MIPS]     [eCos]     [Asterisk Internet PBX]     [Linux API]

  Powered by Linux