Dynamic lookup networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2584, Issue , 2003, Pages 93-96

  Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

LOOKUPS;

ARTIFICIAL INTELLIGENCE;

EID: 35248886678     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37795-6_17     Document Type: Article

References (21)

1. Y. Amir, C. Danilov, and J. Stanton. A low latency, loss tolerant architecture and protocol for wide area group communication. In International Conference on Dependable Systems and Networks (FTCS-30, DCCA-8), New York, 2000.
2. L. Barriere, P. Fraigniaud, E. Kranakis and D. Krizanc. "Efficient routing in networks with long range contacts". In the 15th International Symposium on Distributed Computing (DISC'01), October 2001.
3. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. "Freenet: A distributed anonymous information storage and retrieval system". In Proceedings the ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, 2000.
4. T. H. Cormen, C. E. Leiserson and R. L. Rivest. "Introduction to algorithms". MIT Press, 1990.
5. http://gnutella.wego.com.
6. A. Fiat and J. Saia. "Censorship resistant peer-to-peer content addressable networks". Proceedings of the 13th ACM-SIAM Symp. on Discrete Algorithms, 2002.
7. D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web". In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pages 654-663, May 1997.
8. J. Kleinberg. "The small world phenomenon: An algorithmic perspective". Cornell Computer Science Technical Report 99-1776, October 1999.
9. (Published, shorter version available as "Navigation in a Small World", Nature 406(2000).)
10. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. "OceanStore: An architecture for global-scale persistent storage", Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
11. N. Lynch, D. Malkhi and D. Ratajczak. "Atomic data access in Content Addressable Networks: A position paper". Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02).
12. D. Malkhi, M. Naor and D. Ratajczak. "Viceroy: A scalable and dynamic emulation of the Butterfly". In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02 ), July 2002. To appear.
13. G. Pandurangan, P. Raghavan and E. Upfal. "Building low-diameter p2p networks". Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
14. C. Plaxton, R. Rajaram, and A. Richa. "Accessing nearby copies of replicated objects in a distributed environment". In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 97), pages 311-320, June 1997.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. "A scalable content-addressable network". In Proceedings of the ACM SIGCOMM 2001 Technical Conference. August 2001.
16. A. Rowstron and P. Druschel. "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems". IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, November 2001.
17. http://www.setiathome.ssl.berkeley.edu.
18. H. J. Siegel. "Interconnection networks for SIMD machines". Computer 12(6):57-65, 1979.
19. I. Stoica, R. Morris, D. Karger, M. F. Kaashock, and H. Balakrishnan. "Chord: A scalable peer-to-peer lookup service for Internet applications". In Proceedings of the SIGCOMM 2001, August 2001.
20. C. K. Toh. Ad Hoc mobile wireless networks: Protocols and systems. Prentice Hall, 2001.
21. B. Y. Zhao, J. D. Kubiatowicz and A. D. Joseph. "Tapestry: An infrastructure for fault-tolerant wide-area location and routing". U. C. Berkeley Technical Report UCB/CSD-01-1141, April, 2001.