SpiderCast: A scalable interest-aware overlay for topic-based pub/sub communication

ACM International Conference Proceeding Series

Volumn 233, Issue , 2007, Pages 14-25

  Chockler, Gregory ^a   Melamed, Roie ^a   Tock, Yoav ^a   Vitenberg, Roman ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b UNIVERSITY OF OSLO   (Norway)

Author keywords

Overlay networks; Peer to peer; Pub sub systems; Scalability

Indexed keywords

COST EFFECTIVENESS; DECENTRALIZED CONTROL; PROBABILITY DISTRIBUTIONS; RESOURCE ALLOCATION; SCALABILITY;

OVERLAY NETWORKS; PEER-TO-PEER SYSTEMS; PUB/SUB SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548042566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1266894.1266899     Document Type: Conference Paper

References (23)

1. A. Allavena, A. Demers, and J. Hopcroft. Correctness of a gossip based membership protocol. In PODC, 2005.
2. E. Anceaume, M. Gradinariu, A. K. Datta, G. Simon, and A. Virgillito. A semantic overlay for self-* peer-to-peer publish/subscribe. In ICDCS, 2006.
3. S. Baehni, P. T. Eugster, and E. Guerraoui. Data-aware multicast. In DSN, 2004.
4. R. Baldoni, C. Marchetti, A. Virgillito, and R. Vitenberg. Content-Based Publish-Subscribe over Structured Overlay Networks. In ICDCS, 2005.
5. S. Bhola, R. Strom, S. Bagchi, Y. Zhao, and J. Auerbach. Exactly-once delivery in a content-based publish-subscribe system. In DSN, 2002.
6. K. Birman. Building Secure and Reliable Network Applications. Manning, 1996.
7. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Trans. Comput. Syst., 17(2):41-88, 1999.
8. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE J. Sel. Areas in Coram., 20(8):1489-1499, 2002.
9. R. Chand and P. Felber. Semantic peer-to-peer overlays for publish/subscribe networks. In Euro-Par 2005 Parallel Processing, LNCS, volume 3648, pages 1194-1204. Springer Verlag, 2005.
10. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In ACM SIGCOMM, 2003.
11. P. T. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst., 21(4):341-374, 2003.
12. R. Guerraoui, S. Handurukande, and A.-M. Kermarrec. Gosskip: a gossip-based structured overlay network for efficient content-based filtering. Technical Report IC/2004/95, EPFL, Lausanne, 2004.
13. J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and H. W. O. Jr. Overcast: reliable multicasting with an overlay network. In OSDI, 2000.
14. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: High bandwidth data dissemination using an overlay mesh. In SOSP, pages 282-297, October 2003.
15. H. Liu, V. Ramasubramanian, and E. G. Sirer. Client behavior and feed characteristics of rss, a publish-subscribe system for web micronews. In IMC, 2005.
16. R. Melamed and I. Keidar. Araneola: A Scalable Reliable Multicast System for Dynamic Environments. In NCA, 2004.
17. V. Ramasubramanian, R. Peterson, and E. G. Sirer. Corona: A high performance publish-subscribe system for the world wide web. In NSDI, 2006.
18. D. Sandler, A. Mislove, A. Post, and P. Druschel. Feedtree: Sharing web micronews with peer-to-peer event notification. In IPTPS, 2005.
19. C. Tang, R. N. Chang, and C. Ward. Gocast: Gossip-enhanced overlay multicast for fast and dependable group communication. In DSN, 2005.
20. W. W. Terpstra, S. Beimel, L. Fiege, A. Zeidler, and A. P. Buchmann. A peer-to-peer approach to content-based publish/subscribe. In DEBS, 2003.
21. Y. Tock, N. Naaman, A. Harpaz, and G. Gershinsky. Hierarchical clustering of message flows in a multicast data dissemination system. In 17th IASTED Int'l Conf. Parallel and Distributed Computing and Systems, 2005.
22. S. Voulgaris, E. Riviere, A.-M. Kermarrec, and M. van Steen. Sub-2-sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In IPTPS, 2006.
23. N. Wormald. Models of random regular graphs. Surveys in Combinatorics, 276:239-298, 1999.