Email this article 
Open Access
Subscription or Fee Access
A Scalable and Reliable Matching Service for Content-Based Publish/Subscribe Systems
Abstract
Characterized through the increasing arrival rate of are living content, the emergency purposes pose a best mission: approaches to disseminate tremendous-scale live content to customers in a scalable and dependable process. The post/subscribe (pub/sub) model is probably used for knowledge dissemination on the grounds that of its capability of seamlessly growing the approach to massive dimension. Nevertheless, most occasion matching choices of existing pub/sub techniques both lead to low matching throughput when matching a giant number of skewed dub ascriptions,[12] or interrupt dissemination when a tremendous wide variety of servers fail. The cloud computing provides first-class possibilities for the requirements of complex computing and responsible verbal trade. On this paper, we endorse SREM, a scalable and trustworthy occasion matching supplier for content-situated pub/sub strategies in cloud computing atmosphere. To reap low routing latency and liable links amongst servers, we suggest a disbursed overlay skip Cloud to arrange servers of SREM. By the use of a hybrid area partitioning approach HPartition, large-scale skewed subscriptions are mapped into a couple of subspaces, which ensures high matching throughput and provides multiple candidate servers for each event. Additionally, a sequence of dynamics preservation mechanisms is most likely studied of seconds despite the fact that a significant number of servers fail even as.
Keywords
References
Dataperminite. (2014). [Online]. Available: http://www.domo. Com/blog/2012/06/how-much-data-is-created-every-minute/
F. Benevento, T. Rodrigues, M. Cha, and V. Almeida, “Characterizing user behaviour in online social networks,” in Proc. 9th ACM SIGCOMM Conf. Internet Meas. Conf., 2009, pp. 49–62.12 IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 3, NO. 1, JANUARY-MARCH 2015
A. Carzaniga, “Architectures for an event notification service scalable to wide-area networks,” Ph.D. dissertation, Ingegneria .Informaticae Automatica, Polytechnic diMilano, Milan, Italy, 1998.
P.EugsterandJ.Stephen,“Universalcross-cloudcommunication,”IEEETrans.CloudComput.,vol.2,no.2,pp.103–116,2014.
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.
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.
F. Cao and J. P. Singh, “Efficient event routing in content-based publish/subscribe service network,” in Proc. IEEE INFOCOM, 2004, pp. 929–940.
S. Voulgaris, E. Riviere, A. Kermarrec, and M. Van Steen, “Sub-2sub: Self-organizing content-based publish and subscribe for dynamic and large scale collaborative networks,” Res. Rep. RR5772, INRIA, Rennes, France, 2005.
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.
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 Compute., 2007, pp. 379– 387.
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.
X. Lu, H. Wang, J. Wang, J. Xu, and D. Li, “Internet-based virtual computing environment: Beyond the data centre as a computer,” Future Gener. Comput. Syst., vol. 29, pp. 309–322, 2011.
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.
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.
M. Li, F. Ye, M. Kim, H. Chen, and H. Lei, “A scalable and elastic publish/subscribe service,” in Proc. IEEE Int. Parallel Disturb. Process. Symp., 2011, pp. 1254–1265.
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.
A. Lakshmana and P. Malik, “Cassandra: A decentralized structured storage system,” Oper. Syst. Rev., vol. 44, no. 2, pp. 35–40, 2010.
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.
S. Voulgaris, D. Gavidia, and M. van Steen, “Cyclone: Inexpensive membership management for unstructured p2p overlays,” J. Netw. Syst. Manage., vol. 13, no. 2, pp. 197–217, 2005.
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.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.