Benlog

crypto applied to public policy

Meeting of the Bens

Filed under: crypto — February 12, 2006 @ 5:10 pm

A couple of days ago, I had lunch with Ben Laurie and Ben Hyde. Great discussion about identity infrastructures and standards bodies.

So I just read BenL’s post about the BenL+BenH idea of load-balancing a distributed hash table using logarithmic load hand-off… fantastic. The only downside I see is that this inherently increases the number of queries to the DHT, regardless of how popular the file is. Would it make more sense to have a short request to the main host first, which can respond with a 500-style error. Of course, this assumes the host is not so swamped that it can’t even respond to such pings. In the end, the right answer probably depends on the distribution curve of file popularity.

No Comments »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a comment

Line and paragraph breaks automatic, e-mail address never displayed, HTML allowed: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>