Abstract
In implicit multicast, receiving processes delineate the messages they wish to receive by specifying predicates, also called filters, on the message’s content. In weighted partial message matching, distributed applications using implicit multicast protocols do not require that a message match all the elementary constraints constituting the filter. Typically, receiving processes in such applications associate a non-negative weight to each constraint and require that the match score, i.e., sum of the weights of matching constraints, exceeds a threshold value. In this paper, we consider top-k weighted partial matching, where a process is interested in multicasting a message only to k < n other processes corresponding to the top-k match scores. This is a fundamental problem underlying online advertising platforms, mobile social networks, online dating, etc.
Funded by US NSF grants 0644013 and 0834529, DARPA grant N11AP20014, and by Purdue Research Foundation grant 205434.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culhane, W., Jayaram, K.R., Eugster, P. (2012). Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-33651-5_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33650-8
Online ISBN: 978-3-642-33651-5
eBook Packages: Computer ScienceComputer Science (R0)