Storing and Replication in Topic-Based Publish/Subscribe Networks

In current publish/subscribe networks messages are not stored and only active subscribers receive published messages. However, in a dynamic scenario a user may be interested in content published before the subscription time. In this paper, we introduce a mechanism that enables storing in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore, we propose a new storage placement and replication algorithm which differentiates classes of content and minimize the clients response latency. The performance of our proposed placement and replication algorithm and the proposed storing mechanism is evaluated via simulations and insights are given for future work.

[1]  Gian Pietro Picco,et al.  REDS: a reconfigurable dispatching system , 2006, SEM '06.

[2]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[4]  Magnus Karlsson,et al.  A Framework for Evaluating Replica Placement Algorithms , 2002 .

[5]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[6]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[7]  Hans-Arno Jacobsen,et al.  Historic data access in publish/subscribe , 2007, DEBS '07.

[8]  XuJianliang,et al.  QoS-Aware Replica Placement for Content Distribution , 2005 .

[9]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[12]  Vahab S. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA '06.

[13]  Bo Li,et al.  Dynamic and distributed Web caching in active networks , 1998 .

[14]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[15]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[16]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[17]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Leandros Tassiulas,et al.  Caching in Content-Based Publish/Subscribe Systems , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.