Storage planning and replica assignment in content-centric publish/subscribe networks

Computer Networks

Volumn 55, Issue 18, 2011, Pages 4021-4032

  Sourlas, Vasilis ^a   Flegkas, Paris ^a,b   Paschos, Georgios S ^a,b   Katsaros, Dimitrios ^a,b   Tassiulas, Leandros ^a,b  

^a UNIVERSITY OF THESSALY   (Greece)

^b INFORMATION TECHNOLOGIES INSTITUTE   (Greece)

Author keywords

Content centric publish subscribe networks; Replica assignment; Storage planning

Indexed keywords

ASSIGNMENT ALGORITHMS; ASYNCHRONOUS COMMUNICATION; CONTENT DELIVERY NETWORK; CONTENT DISTRIBUTION; CONTENT-BASED; FLEXIBLE COMMUNICATION; INFORMATION NEED; ORIGIN AND DESTINATIONS; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE NETWORKS; REPLICA ASSIGNMENT; SEMANTIC ATTRIBUTE; STORAGE SERVERS;

INFORMATION THEORY; SEMANTIC WEB; SEMANTICS;

ALGORITHMS;

EID: 80054999436     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2011.07.023     Document Type: Article

References (22)

1. M.K. Aguilera, R.E. Strom, D.C. Sturman, M. Astley, T.D. Chandra, Matching events in a content-based subscription system, in: Proceedings of 18th ACM PODC Atlanta, May, 1999.
2. A. Carzaniga, D. Rosenblum, and A. Wolf Design and evaluation of a wide-area event notification service ACM Transactions On Computer Systems 19 2001 332 383 (Pubitemid 33619857)
3. B. Segall, D. Arnold, Elvin has left the building: A publish/subscribe notification service with quenching, in: Proceedings of AUUG, Brisbane, Australia, September 3-5, 1997, pp. 243-255.
4. G. Cugola, G. Picco, REDS, A Reconfigurable Dispatching System, in: Proceedings of 6th International workshop on Software Engineering and Middleware, Oregon, 2006, pp. 9-16.
5. V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N. Briggs, R. Braynard, Networking named content, in: Proceedings of the 5th ACM CoNEXT, Rome, Italy, December 1-4, 2009.
6. T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, I. Stoica, A Data-Oriented (and Beyond) Network Architecture, in: Proceedings of SIGCOMM, 2007.
7. PURSUIT FP7 EU project, http://www.fp7-pursuit.eu/PursuitWeb/.
8. SAIL FP7 EU project, http://www.sail-project.eu/.
9. G. Li, A. Cheung, S. Hou, S. Hu, V. Muthusamy, R. Sherafat, A. Wun, H. Jacobsen, S. Manovski, Historic data access in publish/subscribe, in: Proceedings of DEBS, Toronto, Canada, 2007, pp. 80-84. (Pubitemid 47281508)
10. V. Sourlas, G.S. Paschos, P. Flegkas, L. Tassiulas, Caching in content-based publish/subscribe systems, in: Proceedings of IEEE Globecom, Honolulu, USA, December 2009.
11. V. Sourlas, P. Flegkas, G.S. Paschos, D. Katsaros, L. Tassiulas, Storing and Replication in Topic-Based Publish/Subscribe Networks, in: Proceedings of IEEE Globecom, Miami, USA, December 2010.
12. B. Li, M.J. Golin, G.F. Ialiano, X. Deng, On the Optimal Placement of Web Proxies in the Internet, in: Proceedings of INFOCOM, March, 1999.
13. I. Cidon, S. Kutten, R. Soffer, Optimal allocation of electronic content, in: Proceedings of INFOCOM, Anchorage, April 2001.
14. J. Kangasharju, J. Roberts, and K. Ross Object replication strategies in content distribution networks Computer Communications 25 2002 376 383 (Pubitemid 33143466)
15. L. Qiu, V.N. Padmanabhan, G. Voelker, On the placement of web server replicas, in: Proceedings of IEEE INFOCOM, Anchorage, USA, April 2001.
16. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, V. Pandit, Local search heuristics for k-median and facility location problems, in: Proceedings of 33rd ACM Symposium on Theory of Computing, 2001.
17. M. Charikar, S. Guha, Improved combinatorial algorithms for facility location and k-median problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, October 1999, pp. 378-388. (Pubitemid 129306191)
18. M. Charikar, S. Khuller, D. Mount, G. Narasimhan, Facility location with outliers, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, January 2001.
19. D.B. Shmoys, E. Tardos, K.I. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 265-274.
20. E. Cronin, S. Jamin, C. Jin, T. Kurc, D. Raz and Y. Shavitt, Constrained mirror placement on the Internet, in IEEE JSAC, 36(2), September 2002.
21. M. Karlsson, Ch. Karamanolis, M. Mahalingam, A Framework for Evaluating Replica Placement Algorithms, 2002 ().
22. R. Cohen, L. Katzir, and D. Raz An efficient approximation for the generalized assignment problem Information Processing Letters 100 2006 162 166