A scalable and reliable matching service for content-based publish/subscribe systems

IEEE Transactions on Cloud Computing

Volumn 3, Issue 1, 2015, Pages 1-13

  Ma, Xingkong ^a   Wang, Yijie ^a   Pei, Xiaoqiang ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

cloud computing; content space partitioning; event matching; overlay construction; Publish subscribe

Indexed keywords

CLOUD COMPUTING; PARTITIONS (BUILDING); SWITCHING CIRCUITS;

CLOUD COMPUTING ENVIRONMENTS; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; EVENT MATCHING; OVERLAY CONSTRUCTION; PARTITIONING TECHNIQUES; PUBLISH/SUBSCRIBE; RELIABLE COMMUNICATION; SPACE PARTITIONING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84924668240     PISSN: None     EISSN: 21687161     Source Type: Journal    
DOI: 10.1109/TCC.2014.2338327     Document Type: Article

References (27)

1. Dataperminite. (2014). [Online]. Available: http://www.domo.com/blog/2012/06/how-much-data-is-created-every-minute/
2. F. Benevenuto, T. Rodrigues, M. Cha, and V. Almeida, "Characterizing user behavior in online social networks," in Proc. 9th ACM SIGCOMM Conf. Internet Meas. Conf., 2009, pp. 49-62.
3. A. Carzaniga, "Architectures for an event notification service scalable to wide-area networks," Ph.D. dissertation, Ingegneria Informatica e Automatica, Politecnico di Milano, Milan, Italy, 1998.
4. P. Eugster and J. Stephen, "Universal cross-cloud communication," IEEE Trans. Cloud Comput., vol. 2, no. 2, pp. 103-116, 2014.
5. R. S. Kazemzadeh and H.-A Jacobsen, "Reliable and highly available distributed publish/subscribe service," in Proc. 28th IEEE Int. Symp. Reliable Distrib. Syst., 2009, pp. 41-50.
6. Y. Zhao and J. Wu, "Building a reliable and high-performance content-based publish/subscribe system," J. Parallel Distrib. Comput., vol. 73, no. 4, pp. 371-382, 2013.
7. F. Cao and J. P. Singh, "Efficient event routing in content-based publish/subscribe service network," in Proc. IEEE INFOCOM, 2004, pp. 929-940.
8. S. Voulgaris, E. Riviere, A. Kermarrec, and M. Van Steen, "Sub-2-sub: Self-organizing content-based publish and subscribe for dynamic and large scale collaborative networks," Res. Rep. RR5772, INRIA, Rennes, France, 2005.
9. I. Aekaterinidis and P. Triantafillou, "Pastrystrings: A comprehensive content-based publish/subscribe DHT network," in Proc. IEEE Int. Conf. Distrib. Comput. Syst., 2006, pp. 23-32.
10. R. Ranjan, L. Chan, A. Harwood, S. Karunasekera, and R. Buyya, "Decentralised resource discovery service for large scale federated grids," in Proc. IEEE Int. Conf. e-Sci. Grid Comput., 2007, pp. 379-387.
11. A. Gupta, O. D. Sahin, D. Agrawal, and A. El Abbadi, "Meghdoot: Content-based publish/subscribe over p2p networks," in Proc. 5th ACM/IFIP/USENIX Int. Conf. Middleware, 2004, pp. 254-273.
12. X. Lu, H. Wang, J. Wang, J. Xu, and D. Li, "Internet-based virtual computing environment: Beyond the data center as a computer," Future Gener. Comput. Syst., vol. 29, pp. 309-322, 2011.
13. Y. Wang, X. Li, X. Li, and Y. Wang, "A survey of queries over uncertain data," Knowl. Inf. Syst., vol. 37, no. 3, pp. 485-530, 2013.
14. W. Rao, L. Chen, P. Hui, and S. Tarkoma, "Move: A large scale keyword-based content filtering and dissemination system," in Proc. IEEE 32nd Int. Conf. Distrib. Comput. Syst., 2012, pp. 445-454.
15. M. Li, F. Ye, M. Kim, H. Chen, and H. Lei, "A scalable and elastic publish/subscribe service," in Proc. IEEE Int. Parallel Distrib. Process. Symp., 2011, pp. 1254-1265.
16. X. Ma, Y. Wang, Q. Qiu, W. Sun, and X. Pei, "Scalable and elastic event matching for attribute-based publish/subscribe systems," Future Gener. Comput. Syst., vol. 36, pp. 102-119, 2013.
17. A. Lakshman and P. Malik, "Cassandra: A decentralized structured storage system," Oper. Syst. Rev., vol. 44, no. 2, pp. 35-40, 2010.
18. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "Xoring elephants: Novel erasure codes for big data," in Proc. 39th Int. Conf. Very Large Data Bases, 2013, pp. 325-336.
19. S. Voulgaris, D. Gavidia, and M. van Steen, "Cyclon: Inexpensive membership management for unstructured p2p overlays," J. Netw. Syst. Manage., vol. 13, no. 2, pp. 197-217, 2005.
20. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 41-53, Jan. 2004.
21. Murmurhash. (2014). [Online]. Available: http://burtleburtle. net/bob/hash/doobs.html
22. A.-M Kermarrec, L. Massoulié, and A. J. Ganesh, "Probabilistic reliable dissemination in large-scale systems," IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 3, pp. 248-258, Mar. 2003.
23. M. Jelasity, A. Montresor, and Ö. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Trans. Comput. Syst., vol. 23, no. 3, pp. 219-252, 2005.
24. Cloudstack. (2014). [Online]. Available: (http://cloudstack. apache.org/)
25. Zeroc. (2014). [Online]. Available: (http://www.zeroc.com/)
26. B. He, D. Sun, and D. P. Agrawal, "Diffusion based distributed internet gateway load balancing in a wireless mesh network," in Proc. IEEE Global Telecommun. Conf., 2009, pp. 1-6.
27. Y. Wang and S. Li, "Research and performance evaluation of data replication technology in distributed storage systems," Comput. Math. Appl., vol. 51, no. 11, pp. 1625-1632, 2006.