[p2p-hackers] Has CAN been implemented by any open source project?

[Lemon Obrien]

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.
 
thanks
lemon

"Sean C. Rhea" <srhea at cs.berkeley.edu> wrote:
On May 18, 2005, at 2:55 AM, Li Tang wrote:
> I am looking for some open source resources of DHT algorithms. 
> While I
> have found projects related to Chord, Pastry, and Tapestry, I got 
> little
> implementation of CAN.
> Is anybody aware of related information? Any pointers, not limited 
> to
> CAN, would be greatly appreciated!

There was never a CAN implementation (outside of simulation) by the CAN 
authors. Several other groups produced implementations of CAN for the 
purposes of writing papers, but no one ever produced a full 
implementation AFAIK. (None of them handled node failure, for 
example.)

Sean
-- 
Once, someone asked me what pleasure I took in riding for so long.
'Pleasure?' I said. 'I don't understand the question.' I didn't
do it for pleasure. I did it for pain.
-- Lance Armstrong

_______________________________________________
p2p-hackers mailing list
p2p-hackers at zgp.org
http://zgp.org/mailman/listinfo/p2p-hackers
_______________________________________________
Here is a web page listing P2P Conferences:
http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences


You don't get no juice unless you squeeze
Lemon Obrien, the Third.
		
---------------------------------
Do you Yahoo!?
 Make Yahoo! your home page   
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://zgp.org/pipermail/p2p-hackers/attachments/20050518/339e8c57/attachment.html