Pagoda: A dynamic overlay network for routing, data management, and multicasting

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 170-179

  Bhargava, Ankur ^a   Kothapalli, Kishore ^a   Riley, Chris ^a   Scheideler, Christian ^a   Thober, Mark ^a  

^a Johns Hopkins University   (United States)

Author keywords

Multicasting; Peer to peer networks; Routing

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; FINITE DIFFERENCE METHOD; GRAPH THEORY; LOGIC DESIGN; MULTICASTING; ROUTERS;

CENTRAL SERVER; DATA MANAGEMENT; DYNAMIC OVERLAY NETWORK; PEER-TO-PEER NETWORKS;

SWITCHING NETWORKS;

EID: 8344274309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov. A generic scheme for building overlay networks in adversarial scenarios. In IPDPS 2003.
2. M. Adler, E. Halperin, R. Karp, and V. Vazirani. A stochastic process on the hypercube with applications to peer-to-peer systems. In STOC 2003.
3. J. Aspnes and G. Shah. Skip graphs. In SODA 2003.
4. B. Awerbuch and C. Scheideler. The Hyperring: A deterministic data structure for distributed environments. In SODA 2004.
5. S. Banerjee and B. Bhattacharjee and C. Kommareddy. Scalable Application Layer Multicast. Techical Report, UMIACS-TR 2002-53 and CS-TR 4373, University of Maryland, 2002.
6. M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in communications, 2002.
7. M. Castro, M.B. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman. An evaluation of scalable application-level multicast built using peer-to-peer overlay network. In Infocom 2003.
8. E. W. Dijkstra. Self stabilization in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
9. H. Deshpande and M. Bawa and H. Garcia-Molina. Streaming Live Media over a Peer-to-Peer Network. Technical Report 2001-31, Stanford University, 2001.
10. J. R. Douceur. The Sybil attack. In IPTPS 2002.
11. N. J. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In USITS 2003.
12. J. Jannotti and D. Gifford and K. Johnson and F. Kaashoek and J. O'Toole. Overcast: Reliable multicasting with an overlay network. In OSDI 2000.
13. M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In IPTPS 2003.
14. Kazaa. Kazaa home page, http://www.kazaa.com/, 2003.
15. K. Lakshminarayanan, A. Rao, I. Stoica, and S. Shenker. Flexible and Robust Large Scale Multicast Using I3. UCB Technical Report No. UCB/CSD-02-1187, May 2002.
16. D.H. Lawrie. Access and alignment of data in an array processor. IEEE Transactions on Computers, vol. C-24, no.12, pages 1145-1155, 1975.
17. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In SIGCOMM 2003.
18. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In PODC 2002.
19. M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach. In SPAA 2003.
20. W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. Lser. Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks. In Int. World Wide Web Conference, 2003.
21. A. Ranade. How to emulate shared memory. J. of Computer and System Sciences, 42:307-326, 1990.
22. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM 2001.
23. S. Ratnasamy, M. Handley, R.M. Karp, and S. Shenker. Application-level multicast using content-addressable networks. In Networked Group Communication, pages 1429, 2001.
24. C. Riley and C. Scheideler. Guaranteed broadcasting using SPON: Supervised P2P overlay network. In 2004 International Zürich Seminar on Communications.
25. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
26. C. Scheideler. Universal Routing Strategies for Interconnection Networks. Lecture Notes in Computer Science 1390. Spinger, 1998.
27. M. Srivatsa, B. Gedik, and L. Liu. Scaling unstructured peer-to-peer networks with multi-tier capacity-aware overlay topologies. See http://www.cc.gatech.edu/~mudhakar/.
28. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana. Internet indirection infrastructure. In SIGCOMM 2002.
29. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM 2001.
30. B. Traversat, A. Arora, M. Abdelaziz, M. Duigou, C. Haywood, J.-C. Hugly, E. Pouyoul, and B. Yeager. Project JXTA 2.0 Super-Peer Virtual Network. Sun Microsystems, May 2003.
31. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. UCB Technical Report UCB/CSD-01-1141, 2001.
32. B. Yang, H. Garcia-Molina. Designing a super-peer network. In ICDE 2003.
33. Y. Zhu, H. Wang and Y. Hu. A super-peer based lookup in highly structured peer-to-peer networks. In PDCS 2003.
34. S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, and J.D. Kubiatowicz. Bayeux: An architecture for scalable and fault tolerant wide-area data dissemination. In NOSSDAV 2001.