Hi Vijay, The results are from the journal version of the Chord paper which is "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications", IEEE/ACM Transactions on Networking, vol 11, 2003." The paper is available at: http://pdos.csail.mit.edu/chord/papers/paper-ton.pdf
Independent of that I have also performed simulations with a different platform and observed similar gains as reported in the paper above. Apart from these, there are several papers that list the benefits of locality awareness but for other DHTs such Pastry. Locality awareness has also been proposed for the popular Kademlia DHT which uses iterative routing. http://www2.computer.org/portal/web/csdl/doi/10.1109/P2P.2008.36 Thanks, Saumitra -----Original Message----- From: Vijay K. Gurbani [mailto:[EMAIL PROTECTED] Sent: Friday, November 14, 2008 8:53 AM To: Das, Saumitra Cc: Enrico Marocco Subject: Re: [P2PSIP] Suggested enhancement for default Chord topology plugin Das, Saumitra wrote: > A simulation study with a different simulator in Ref 1 using 2^16 > nodes and an euclidean RTT model and transit-stub model showed lookup > stretch reductions of 31% to 40% as well. > > Ref 1: "Chord: A Scalable Peer-to-peer Lookup Service for Internet > Applications", IEEE/ACM Transactions on Networking, vol 11, 2003." Saumitra: The study you refer to above, is it public? If so, do you have the name of the paper that describes its results? I am aware of one or two (the TU-Berlin work, for instance) that fit the bill as described above, but am curious to see if I have overlooked any. Thanks, - vijay -- Vijay K. Gurbani, Bell Laboratories, Alcatel-Lucent 1960 Lucent Lane, Rm. 9C-533, Naperville, Illinois 60566 (USA) Email: [EMAIL PROTECTED],bell-labs.com,acm.org} Web: http://ect.bell-labs.com/who/vkg/ _______________________________________________ P2PSIP mailing list [email protected] https://www.ietf.org/mailman/listinfo/p2psip
