The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 24)
ISSN: 1041-4347
pp: 1833-1847
Pankaj K. Agarwal , Duke University, Durham
Albert Yu , Duke University, Durham
Jun Yang , Duke University, Durham
ABSTRACT
We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in the event space and subscriber locations in the network space, and balance multiple performance criteria including bandwidth, delay, and load balance. The resulting optimization problem is NP-complete, so systems have turned to heuristics and/or simpler algorithms that ignore some performance criteria. Evaluating these approaches has been challenging because optimal solutions remain elusive for realistic problem sizes. To enable proper evaluation, we develop a Monte Carlo approximation algorithm with good theoretical properties and robustness to workload variations. To make it computationally feasible, we combine the ideas of linear programming, randomized rounding, coreset, and iterative reweighted sampling. We demonstrate how to use this algorithm as a yardstick to evaluate other algorithms, and why it is better than other choices of yardsticks. With its help, we show that a simple greedy algorithm works well for a number of workloads, including one generated from publicly available statistics on Google Groups. We hope that our algorithms are not only useful in their own right, but our principled approach toward evaluation will also be useful in future evaluation of solutions to similar problems in content-based publish/subscribe.
INDEX TERMS
Bismuth, Bandwidth, Filtering algorithms, Optimization, Complexity theory, Approximation algorithms, Materials, wide-area networks., Network architecture and design
CITATION
Pankaj K. Agarwal, Albert Yu, Jun Yang, "Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe", IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 1833-1847, Oct. 2012, doi:10.1109/TKDE.2012.65
197 ms
(Ver )