A generic scheme for building overlay networks in adversarial scenarios

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Abraham, Ittai ^a   Awerbuch, Baruch ^b   Azar, Yossi ^c   Bartal, Yair ^a   Malkhi, Dahlia ^a   Pavlov, Elan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS;

ADAPTIVE ADVERSARY; DYNAMIC NETWORK; EFFICIENT ROUTING; LONG LIFE; LOW DIAMETERS; MALICIOUS ADVERSARIES; PERIODIC STABILIZATION;

OVERLAY NETWORKS;

EID: 84947294325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213125     Document Type: Conference Paper

References (18)

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. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal of Computing 29(1):180-200, 1999.
3. N. G. de Bruijn. A combinatorial problem, Konink. Nederl. Akad. Wetersh. Verh. Afd. Natuurk. Eerste Reelss, A49 (1946), pp. 758-764.
4. 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.
5. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the 13th ACM-SIAM Symposiumon Discrete Algorithms, 2002.
6. http://gnutella. wego. com.
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". Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 654-663, May 1997.
8. J. Kleinberg. The small world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, May 2000, pp. 163-170. (A shorter version available as "Navigation in a Small World", Nature 406, August 2000, pp. 845. )
9. 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), August 2002.
10. M. Mitzenmacher, A. Richa and R. Sitaraman. The power of two random choices: A survey of techniques and results. IEEE Transactions on Parallel and Distributed Systems 12(10):1094-1104, 2001.
11. G. Pandurangan, P. Raghavan and E. Upfal. Building low-diameter p2p networks. In Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
12. 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), pp. 311-320, June 1997.
13. 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.
14. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for largescale peer-to-peer systems. In 18 Conference on Distributed Systems Platforms, Heidelberg (D), 2001, LNCS 2218.
15. J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically Fault-Tolerant Content Addressable Networks, In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), March 2002, Cambridge, MA USA
16. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the SIGCOMM 2001, August 2001.
17. C. K. Toh. Ad Hoc mobile wireless networks: Protocols and systems. Prentice Hall, 2001.
18. B. Y. Zhao, J. D. Kubiatowicz and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant widearea location and routing. U. C. Berkeley Technical Report UCB/CSD-01-1141, April, 2001.