<DIV>i making a peer to peer system and did research on various systems of search; how best to do it. I may have implemented CAN; can someone decribe what CAN means and how its alogorythm.</DIV>
<DIV> </DIV>
<DIV>thanks</DIV>
<DIV>lemon<BR><BR><B><I>"Sean C. Rhea" <srhea@cs.berkeley.edu></I></B> wrote:</DIV>
<BLOCKQUOTE class=replbq style="PADDING-LEFT: 5px; MARGIN-LEFT: 5px; BORDER-LEFT: #1010ff 2px solid">On May 18, 2005, at 2:55 AM, Li Tang wrote:<BR>> I am looking for some open source resources of DHT algorithms. <BR>> While I<BR>> have found projects related to Chord, Pastry, and Tapestry, I got <BR>> little<BR>> implementation of CAN.<BR>> Is anybody aware of related information? Any pointers, not limited <BR>> to<BR>> CAN, would be greatly appreciated!<BR><BR>There was never a CAN implementation (outside of simulation) by the CAN <BR>authors. Several other groups produced implementations of CAN for the <BR>purposes of writing papers, but no one ever produced a full <BR>implementation AFAIK. (None of them handled node failure, for <BR>example.)<BR><BR>Sean<BR>-- <BR>Once, someone asked me what pleasure I took in riding for so long.<BR>'Pleasure?' I said. 'I don't understand the question.' I didn't<BR>do it for pleasure. I did it for pain.<BR>-- Lance
Armstrong<BR><BR>_______________________________________________<BR>p2p-hackers mailing list<BR>p2p-hackers@zgp.org<BR>http://zgp.org/mailman/listinfo/p2p-hackers<BR>_______________________________________________<BR>Here is a web page listing P2P Conferences:<BR>http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences<BR></BLOCKQUOTE><BR><BR>You don't get no juice unless you squeeze<br>Lemon Obrien, the Third.<p>
<hr size=1>Do you Yahoo!?<br>
<a href="http://us.rd.yahoo.com/my/navbar/sethp/*http://www.yahoo.com/r/hs">Make Yahoo! your home page</a>