Summary-based routing for content-based event distribution networks

Computer Communication Review

Volumn 34, Issue 5, 2004, Pages 59-73

  Wang, Yi Min ^a   Qiu, Lili ^a   Verbowski, Chad ^a   Achlioptas, Dimitris ^a   Das, Gautam ^a   Larson, Paul ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; SERVERS; TELECOMMUNICATION TRAFFIC; THROUGHPUT; XML;

SYSTEM PERFORMANCE; WEB SERVICES; WEB-BASED EVENTING SERVICES; XML-BASED INFRASTRUCTURE;

ROUTERS;

EID: 33645762023     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1039111.1039113     Document Type: Article

References (31)

1. A. Adya, P. Bahl, and L. Qiu. Characterizing alert and browse services for mobile clients. In Proc. of USENIX Annual Conference, Jun. 2002.
2. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In Symposium on Principles of Distributed Computing, pages 53-61, 1999.
3. M. F. Arlitt and C. L. Williamson. Internet Web Servers: Workload Characterization and Performance Implications. In IEEE/ACM Transactions on Networking, pages 631-645, 1997.
4. G. Banavar, T. D. Chandra, B. Mukherjee, J. Nagarajarao, R. E. Strom, and D. C. Sturman. An efficient multicast protocol for content-based publish-subscribe systems. In International Conference on Distributed Computing Systems, pages 262-272, 1999.
5. R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. In Proc. 1970 ACM-SIGFIDET Workshop on Data Description and Access, Nov. 1970.
6. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
7. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In Proceedings of INFOCOMM '99, March 1999.
8. A. Carzaniga, J. Deng, and A. L. Wolf. Fast forwarding for content-based networking. In Technical Report CU-CS-922-01, Department of Computer Science, University of Colorado, Nov. 2001.
9. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332-383, 2001.
10. C. Y. Chan, M. Garofalakis, and R. Rastogi. RE-Tree: An efficient index structure for regular expressions. In Proc. of VLDB '2002, 2002.
11. 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 Proc. of SIGMOD Conference, 2001.
12. C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. The node capacitated graph partitioning problem: A computational study. In Mathematical Programming, 1996.
13. Y.J. Garcia, M.A. Lopez, and S.T. Leutenegger. A greedy algorithm for bulk loading R-trees. In Univ. of Denver Computer Science Tech. Report #97-02, 1997.
14. J. Gough and G. Smith. Efficient recognition of events in a distributed system. In Proc. of the 18 th Australasian Computer Science Conference, Feb. 1995.
15. R. Gruber, B. Krishnamurthy, and E. Panagos. The architecture of the ready event notification service. In Proc. of the 19th IEEE International Conference on Distributed Computing Systems Middleware Workshop, 1999.
16. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of ACM SIGMOD Conference, 1984.
17. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proc. of Supercomputing, 1995.
18. A. K. Jain and Dubes. Algorithms for clustering data. 1988.
19. Weighted min cut. http://riot.ieor.berkeley.edu/riot/Applications/ WeightedMinCut/.
20. L. Opyrchal, M. Astley, J. S. Auerbach, G. Banavar, R. E. Strom, and D. C. Sturman. Exploiting IP multicast in content-based publish-subscribe systems. In Proc. of Middleware, pages 185-207, 2000.
21. V. N. Padmanabhan and L. Qiu. The Content and Access Dynamics of a Busy Web Site: Findings and Implications. In Proceedings ACM SIGCOMM 2000, August 2000.
22. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. of IEEE INFOCOM, Jun. 2002.
23. A. Riabov, Z. Liu, J. L. Wolf, P. S. Yu, and L. Zhang. Clustering algorithms for content-based publication-subscription systems. In Proc. of ICDCS, 2002.
24. A. I. T. Rowstron, A. M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In International Workshop on Networked Group Communication, pages 30-43, 2001.
25. B. Segall and D. Arnold. Elvin has left the building: A publish /subscribe notification service with quenching. In Proc. of AUUG, 1997.
26. Alex C. Snoeren, Kenneth Conley, and David K. Gifford. Mesh-based content routing using xml. In ACM Symposium on Operating System Principles, Oct. 2001.
27. Y. M. Wang, P. Bahl, and W. Russell. The SIMBA user alert service architecture for dependable alert delivery. In IEEE Int. Conf. on Dependable Systems and Networks (DSN), 2001.
28. Y. M. Wang, L. Qiu, D. Achlioptas, G. Das, P. Larson, and H. J. Wang. Subscription partitioning and routing in content-based publish/subscribe networks (Brief Announcement). In Proc. of DISC, Oct. 2002.
29. T. Wong, R. H. Katz, and S. McCanne. An evaluation on using preference clustering in large-scale multicast applications. In Proc. of INFOCOM, pages 451-460, 2000.
30. Web Services standards. http://www.webservices.org/index.php/standards/.
31. H. Yu, D. Estrin, and R. Govindan. A hierarchical proxy architecture for internet-scale event services. In Proc. of WETICE, 1999.