Algorithms for efficient filtering in content-based multicast

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 428-439

  Langerman, Stefan ^a   Lodha, Sachin ^a   Shah, Rahul ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; DYNAMIC PROGRAMMING; FORESTRY; MULTICASTING; PIECEWISE LINEAR TECHNIQUES; TREES (MATHEMATICS);

BALANCED SEARCH TREES; CONTENT-BASED MULTICAST; DYNAMIC PROGRAMMING ALGORITHM; INFRASTRUCTURE COSTS; INTERMEDIATE NODE; PIECE-WISE LINEAR FUNCTIONS; PUBLISH-SUBSCRIBE; UNCAPACITATED FACILITY LOCATIONS;

INFORMATION FILTERING;

EID: 84943226543     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44676-1_36     Document Type: Article

References (12)

1. Aguilera et al, "Matching Events in a Content-based Subscription System", http://www.research.ibm.com/gryphon
2. Banavar et al, "An efficient multicast protocol for content-based publish-subscribe systems", Technical report, IBM 1998.
3. Carzaniga et al, "Design of Scalable Event Notification Service: Interface and Ar-chitecture", Tech Report CU-CS-863-98, University of Colorado, Dept. of Computer Science, 1998.
4. Kasera et al, "Scalable Fair Reliable Multicast Using Active Services", IEEE Net-work Magazine, Jan/Feb 2000.
5. F. Anjum and R. Jain, "Generalized Multicast Using Mobile Filtering Agents", Internal Report, Telcordia Tech, Morristown, Mar 00.
6. F. Anjum, R. Jain, S. Rajagopalan and R. Shah, "Mobile Filters for Efficient Dissemination of Personalized Information Using Content-Based Multicast", submitted, 2001.
7. A. Tamir, "An O(pn2) algorithm for the p-median and related problems on tree graphs", Operations Research Letters, 19:59-94, 1996.
8. A. Tamir and T. Lowe, "The generalized p-forest problem on a tree network", Networks 22, 217-230, 1992.
9. G. Cornuejols, G.L. Nemhauser and L.A. Wosley, "The uncapacitated facility lo-cation problem", in P.B. Mirchandani and R.L. Francis(eds), Discrete Location Theory, Wiley, New York, 1990, pp. 119-171.
10. M. Brown and R. Tarjan, "A Fast Merging Algorithm", Journal of ACM, 26(2), pp 211-225, Apr 79.
11. G. Adel'son-Vel'skii and Y. Landis, "An algorithm for the organization of infor-mation", Dokl. Akad. Nauk SSSR 146, 263-266, (in Russian) English translation in Soviet Math. Dokl., 3-1962, pp1259-1262.
12. C. Crane, "Linear lists and priority queues as balanced binary trees", PhD Thesis, Stanford University, 1972.