Loading…
A General Scalable and Elastic Content-Based Publish/Subscribe Service
The big data era is characterized by the emergence of live content with increasing complexities of data dimensionality and data sizes, which poses a new challenge to emergency applications: how to timely disseminate large-scale live content to users who are interested in. The publish/subscribe (pub/...
Saved in:
Published in: | IEEE transactions on parallel and distributed systems 2015-08, Vol.26 (8), p.2100-2113 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793 |
---|---|
cites | cdi_FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793 |
container_end_page | 2113 |
container_issue | 8 |
container_start_page | 2100 |
container_title | IEEE transactions on parallel and distributed systems |
container_volume | 26 |
creator | Wang, Yijie Ma, Xingkong |
description | The big data era is characterized by the emergence of live content with increasing complexities of data dimensionality and data sizes, which poses a new challenge to emergency applications: how to timely disseminate large-scale live content to users who are interested in. The publish/subscribe (pub/sub) model is widely used to disseminate data because of its possibility of expanding the system to Internet-scale size. However, existing pub/sub systems are inadequate to meet the requirement of disseminating live content in the big data era, since their multi-hop routing techniques and coarse-grained partitioning techniques lead to a low matching throughput, and their upload capacities do not scale well. In this paper, we propose a general scalable and elastic pub/sub service based on the cloud computing environment, called GSEC. For generality, we propose a two-layer pub/sub framework to support the dissemination with diverse data sizes and data dimensionality. For scalability, a hybrid space partitioningtechnique is proposed to achieve high matching throughput, which divides subscriptions into multiple clusters in a hierarchical manner. Moreover, a helper-based content distribution technique is proposed to achieve high upload bandwidth, where servers act as both providers and coordinators to fully explore the upload capacity of the system. For elasticity, we propose a performance-aware provisioningtechnique to adjust the scale of servers to adapt to the churn workloads. To evaluate the performance of GSEC, about 1,000 servers are deployed and hundreds of thousands of live content items are tested in our CloudStack-based testbed. Extensive experiments confirm that GSEC can linearly increase the capacities of event matching and content distribution with the growth of servers, adaptively adjust these capacities in tens of seconds according to the churn workloads, and significantly outperforms the state-of-the-art approaches under various parameter settings. |
doi_str_mv | 10.1109/TPDS.2014.2346759 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TPDS_2014_2346759</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6876150</ieee_id><sourcerecordid>3760326791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793</originalsourceid><addsrcrecordid>eNo9kE1Lw0AURQdRsFZ_gLgJuE47byYzySxrbatQsJDuh_l4wZSY1JlE8N-b0uLq3cW598Eh5BHoDICq-X73Ws4YhWzGeCZzoa7IBIQoUgYFvx4zzUSqGKhbchfjgY6koNmErBfJBlsMpklKZxpjG0xM65NVY2Jfu2TZtT22ffpiIvpkN9imjp_zcrDRhdpiUmL4qR3ek5vKNBEfLndK9uvVfvmWbj8278vFNnVM8T5lssoqx61jFoUXlQBJqXfUWwtceixyrzCTznjKuRKK575QgAx9YVSu-JQ8n2ePofseMPb60A2hHT9qkEoxWSgFIwVnyoUuxoCVPob6y4RfDVSfbOmTLX2ypS-2xs7TuVMj4j8vi1yCoPwPYntlOw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1699268991</pqid></control><display><type>article</type><title>A General Scalable and Elastic Content-Based Publish/Subscribe Service</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Wang, Yijie ; Ma, Xingkong</creator><creatorcontrib>Wang, Yijie ; Ma, Xingkong</creatorcontrib><description>The big data era is characterized by the emergence of live content with increasing complexities of data dimensionality and data sizes, which poses a new challenge to emergency applications: how to timely disseminate large-scale live content to users who are interested in. The publish/subscribe (pub/sub) model is widely used to disseminate data because of its possibility of expanding the system to Internet-scale size. However, existing pub/sub systems are inadequate to meet the requirement of disseminating live content in the big data era, since their multi-hop routing techniques and coarse-grained partitioning techniques lead to a low matching throughput, and their upload capacities do not scale well. In this paper, we propose a general scalable and elastic pub/sub service based on the cloud computing environment, called GSEC. For generality, we propose a two-layer pub/sub framework to support the dissemination with diverse data sizes and data dimensionality. For scalability, a hybrid space partitioningtechnique is proposed to achieve high matching throughput, which divides subscriptions into multiple clusters in a hierarchical manner. Moreover, a helper-based content distribution technique is proposed to achieve high upload bandwidth, where servers act as both providers and coordinators to fully explore the upload capacity of the system. For elasticity, we propose a performance-aware provisioningtechnique to adjust the scale of servers to adapt to the churn workloads. To evaluate the performance of GSEC, about 1,000 servers are deployed and hundreds of thousands of live content items are tested in our CloudStack-based testbed. Extensive experiments confirm that GSEC can linearly increase the capacities of event matching and content distribution with the growth of servers, adaptively adjust these capacities in tens of seconds according to the churn workloads, and significantly outperforms the state-of-the-art approaches under various parameter settings.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2014.2346759</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Clustering algorithms ; Humidity ; Routing ; Scalability ; Servers ; Subscriptions ; Throughput</subject><ispartof>IEEE transactions on parallel and distributed systems, 2015-08, Vol.26 (8), p.2100-2113</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793</citedby><cites>FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6876150$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Wang, Yijie</creatorcontrib><creatorcontrib>Ma, Xingkong</creatorcontrib><title>A General Scalable and Elastic Content-Based Publish/Subscribe Service</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>The big data era is characterized by the emergence of live content with increasing complexities of data dimensionality and data sizes, which poses a new challenge to emergency applications: how to timely disseminate large-scale live content to users who are interested in. The publish/subscribe (pub/sub) model is widely used to disseminate data because of its possibility of expanding the system to Internet-scale size. However, existing pub/sub systems are inadequate to meet the requirement of disseminating live content in the big data era, since their multi-hop routing techniques and coarse-grained partitioning techniques lead to a low matching throughput, and their upload capacities do not scale well. In this paper, we propose a general scalable and elastic pub/sub service based on the cloud computing environment, called GSEC. For generality, we propose a two-layer pub/sub framework to support the dissemination with diverse data sizes and data dimensionality. For scalability, a hybrid space partitioningtechnique is proposed to achieve high matching throughput, which divides subscriptions into multiple clusters in a hierarchical manner. Moreover, a helper-based content distribution technique is proposed to achieve high upload bandwidth, where servers act as both providers and coordinators to fully explore the upload capacity of the system. For elasticity, we propose a performance-aware provisioningtechnique to adjust the scale of servers to adapt to the churn workloads. To evaluate the performance of GSEC, about 1,000 servers are deployed and hundreds of thousands of live content items are tested in our CloudStack-based testbed. Extensive experiments confirm that GSEC can linearly increase the capacities of event matching and content distribution with the growth of servers, adaptively adjust these capacities in tens of seconds according to the churn workloads, and significantly outperforms the state-of-the-art approaches under various parameter settings.</description><subject>Clustering algorithms</subject><subject>Humidity</subject><subject>Routing</subject><subject>Scalability</subject><subject>Servers</subject><subject>Subscriptions</subject><subject>Throughput</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNo9kE1Lw0AURQdRsFZ_gLgJuE47byYzySxrbatQsJDuh_l4wZSY1JlE8N-b0uLq3cW598Eh5BHoDICq-X73Ws4YhWzGeCZzoa7IBIQoUgYFvx4zzUSqGKhbchfjgY6koNmErBfJBlsMpklKZxpjG0xM65NVY2Jfu2TZtT22ffpiIvpkN9imjp_zcrDRhdpiUmL4qR3ek5vKNBEfLndK9uvVfvmWbj8278vFNnVM8T5lssoqx61jFoUXlQBJqXfUWwtceixyrzCTznjKuRKK575QgAx9YVSu-JQ8n2ePofseMPb60A2hHT9qkEoxWSgFIwVnyoUuxoCVPob6y4RfDVSfbOmTLX2ypS-2xs7TuVMj4j8vi1yCoPwPYntlOw</recordid><startdate>20150801</startdate><enddate>20150801</enddate><creator>Wang, Yijie</creator><creator>Ma, Xingkong</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150801</creationdate><title>A General Scalable and Elastic Content-Based Publish/Subscribe Service</title><author>Wang, Yijie ; Ma, Xingkong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Clustering algorithms</topic><topic>Humidity</topic><topic>Routing</topic><topic>Scalability</topic><topic>Servers</topic><topic>Subscriptions</topic><topic>Throughput</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Yijie</creatorcontrib><creatorcontrib>Ma, Xingkong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Yijie</au><au>Ma, Xingkong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A General Scalable and Elastic Content-Based Publish/Subscribe Service</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2015-08-01</date><risdate>2015</risdate><volume>26</volume><issue>8</issue><spage>2100</spage><epage>2113</epage><pages>2100-2113</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>The big data era is characterized by the emergence of live content with increasing complexities of data dimensionality and data sizes, which poses a new challenge to emergency applications: how to timely disseminate large-scale live content to users who are interested in. The publish/subscribe (pub/sub) model is widely used to disseminate data because of its possibility of expanding the system to Internet-scale size. However, existing pub/sub systems are inadequate to meet the requirement of disseminating live content in the big data era, since their multi-hop routing techniques and coarse-grained partitioning techniques lead to a low matching throughput, and their upload capacities do not scale well. In this paper, we propose a general scalable and elastic pub/sub service based on the cloud computing environment, called GSEC. For generality, we propose a two-layer pub/sub framework to support the dissemination with diverse data sizes and data dimensionality. For scalability, a hybrid space partitioningtechnique is proposed to achieve high matching throughput, which divides subscriptions into multiple clusters in a hierarchical manner. Moreover, a helper-based content distribution technique is proposed to achieve high upload bandwidth, where servers act as both providers and coordinators to fully explore the upload capacity of the system. For elasticity, we propose a performance-aware provisioningtechnique to adjust the scale of servers to adapt to the churn workloads. To evaluate the performance of GSEC, about 1,000 servers are deployed and hundreds of thousands of live content items are tested in our CloudStack-based testbed. Extensive experiments confirm that GSEC can linearly increase the capacities of event matching and content distribution with the growth of servers, adaptively adjust these capacities in tens of seconds according to the churn workloads, and significantly outperforms the state-of-the-art approaches under various parameter settings.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2014.2346759</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1045-9219 |
ispartof | IEEE transactions on parallel and distributed systems, 2015-08, Vol.26 (8), p.2100-2113 |
issn | 1045-9219 1558-2183 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TPDS_2014_2346759 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Clustering algorithms Humidity Routing Scalability Servers Subscriptions Throughput |
title | A General Scalable and Elastic Content-Based Publish/Subscribe Service |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T22%3A59%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20General%20Scalable%20and%20Elastic%20Content-Based%20Publish/Subscribe%20Service&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Wang,%20Yijie&rft.date=2015-08-01&rft.volume=26&rft.issue=8&rft.spage=2100&rft.epage=2113&rft.pages=2100-2113&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2014.2346759&rft_dat=%3Cproquest_cross%3E3760326791%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c293t-26f4fc3bc2be5d5f51600dc0dbb136de87d9e46cad03395937d891e2ed8a9793%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1699268991&rft_id=info:pmid/&rft_ieee_id=6876150&rfr_iscdi=true |