On efficient content matching in distributed pub/sub systems

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 756-764

  Rao, Weixiong ^a   Chen, Lei ^b   Fu, Ada Wai Chee ^a   Chen, Hanhua ^c   Zou, Futai ^d  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^d SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT MATCHING; COST MODELS; DATA POINTS; DISTRIBUTED ENVIRONMENTS; FAST FORWARDING; HIGH EFFICIENCY; KEY ISSUES; LOW COSTS; MATCHING ALGORITHM; MULTICASTS; PERFORMANCE EVALUATION; PLANETLAB; PUB/SUB; PUBLISH/SUBSCRIBE SYSTEM; SIMULATION ENVIRONMENT; TREE STRUCTURES;

EID: 70349694026     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5061984     Document Type: Conference Paper

References (19)

1. I. Aekaterinidis and P. Triantafillou. Pastrystrings: A comprehensive content-based publish/subscribe dht network. In ICDCS, page 23, 2006.
2. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, 2004.
3. A. R. Bharambe, S. G. Rao, and S. Seshan. Mercury: a scalable publishsubscribe system for internet games. In NETGAMES, pages 3-9, 2002.
4. A. Carzaniga, M. J. Rutherford, and A. L. Wolf. A routing scheme for content-based networking. In INFOCOM, 2004.
5. A. Carzaniga and A. L. Wolf. Forwarding in a content-based network. In SIGCOMM, pages 163-174, 2003.
6. A. Datta, M. Hauswirth, R. John, R. Schmidt, and K. Aberer. Range queries in trie-structured overlays. In Peer-to-Peer Computing, 2005.
7. M. de Berg, M. O. Marc van Kreveld, and O. Schwarzkopf. Computational geometry: Algorithms and applications. In Springer-Verlag, Berlin, 1997.
8. H. Edelsbrunner. A new approach to rectangle intersections. In International Journal Computational Mathematics 13, pages 209-219 and 221-229, 1983.
9. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe. In SIGMOD Conference, pages 115-126, 2001.
10. S. Ganguly, S. Bhatnagar, A. Saxena, R. Izmailov, and S. Banerjee. A fast content-based data distribution infrastructure. In INFOCOM, 2006.
11. A. Gupta, O. D. Sahin, D. Agrawal, and A. E. Abbadi. Meghdoot: Content-based publish/subscribe over p2p networks. In Middleware, pages 254-273, 2004.
12. V. Ramasubramanian and E. G. Sirer. The design and implementation of a next generation name service for the internet. In SIGCOMM, 2004.
13. W. Rao, L. Chen, A. W.-C. Fu, and Y. Bu. Optimal proactive caching in peer-to-peer network: analysis and application. In CIKM, pages 663-672, 2007.
14. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM, 2001.
15. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, pages 329-350, 2001.
16. P. F. S. Bianchi, A.K. Datta and M. Gradinariu. Stabilizing dynamic r-tree-based spatial filters. In ICDCS, pages 447-457, 2007.
17. S. Voulgaris, E. Riviere, A. Kermarrec, and M. van Steen. Sub-2-sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In IPTPS, 2006.
18. R. Zhang and Y. C. Hu. Hyper: A hybrid approach to efficient content-based publish/subscribe. In ICDCS, pages 427-436, 2005.
19. Y. Zhu and Y. Hu. Ferry: An architecture for content-based publish/subscribe services on p2p networks. In ICPP, pages 427-434, 2005.