Abstract
Content-Based Multicast is a type of multicast where the source sends a set of different classes of information and not all the subscribers in the multicast group need all the information. Use of filtering publish-subscribe agents on the intermediate nodes was suggested [5] to filter out the unnecessary information on the multicast tree. However, filters have their own drawbacks like processing delays and infrastructure cost. Hence, it is desired to place these filters most efficiently. An O(n 2 ) dynamic programming algorithm was proposed to calculate the best locations for filters that would minimize overall delays in the network [6]. We propose an improvement of this algorithm which exploits the geometry of piecewise linear functions and fast merging of sorted lists, represented by height balanced search trees, to achieve O(n log n) time complexity. Also, we show an improvement of this algorithm which runs in O(n log h) time, where h is the height of the multicast tree. This problem is closely related to p-median and uncapacitated facility location over trees. Theoretically, this is an uncapacitated analogue of the p-inmedian problem on trees as defined in [9].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aguilera et al, “Matching Events in a Content-based Subscription System”, http://www.research.ibm.com/gryphon
Banavar et al, “An efficient multicast protocol for content-based publish-subscribe systems”, Technical report, IBM 1998.
Carzaniga et al, “Design of Scalable Event Notification Service: Interface and Architecture”, Tech Report CU-CS-863-98, University of Colorado, Dept. of Computer Science, 1998.
Kasera et al, “Scalable Fair Reliable Multicast Using Active Services”, IEEE Network Magazine, Jan/Feb 2000.
F. Anjum and R. Jain, “Generalized Multicast Using Mobile Filtering Agents”, Internal Report, Telcordia Tech, Morristown, Mar 00.
F. Anjum, R. Jain, S. Rajagopalan and R. Shah, “Mobile Filters for Efficient Dissemination of Personalized Information Using Content-Based Multicast”, submitted, 2001.
A. Tamir, “An O(pn 2 ) algorithm for the p-median and related problems on tree graphs”, Operations Research Letters, 19:59–94, 1996.
A. Tamir and T. Lowe, “The generalized p-forest problem on a tree network”, Networks 22, 217–230, 1992.
G. Cornuejols, G.L. Nemhauser and L.A. Wosley, “The uncapacitated facility location problem”, in P.B. Mirchandani and R.L. Francis(eds), Discrete Location Theory, Wiley, New York, 1990, pp. 119–171.
M. Brown and R. Tarjan, “A Fast Merging Algorithm”, Journal of ACM, 26(2), pp 211–225, Apr 79.
G. Adel’son-Vel’skii and Y. Landis, “An algorithm for the organization of information”, Dokl. Akad. Nauk SSSR 146, 263–266, (in Russian) English translation in Soviet Math. Dokl., 3-1962, pp1259–1262.
C. Crane, “Linear lists and priority queues as balanced binary trees”, PhD Thesis, Stanford University, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Langerman, S., Lodha, S., Shah, R. (2001). Algorithms for Efficient Filtering in Content-Based Multicast. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive