Vector subscriptions and sharing mechanism for content-based publish/subscribe system

Tao YOU; Qi-man WU; Chuan-wen WANG; Dong ZHONG; Cheng-lie DU

doi:10.11959/j.issn.1000-436x.2015191

您当前的位置：

首页 >

文章列表页 >

Vector subscriptions and sharing mechanism for content-based publish/subscribe system

academic paper | 更新时间：2024-06-05

- Vector subscriptions and sharing mechanism for content-based publish/subscribe system
- Journal on Communications Vol. 36, Issue 10, Pages: 101-109(2015)
- 作者机构：
  
  西北工业大学计算机学院，陕西西安 710129
- 作者简介：
- 基金信息：
  
  Aviation Science Foundation of China(20135553034);The Fundamental Research Funds for the Central Univer-sities(3102014JSJ0008);Undergraduate Graduation Design Key Project for 2014 Northwestern Polytechnical University
- DOI：10.11959/j.issn.1000-436x.2015191
  CLC： TP393
- Online First：2015-10，
  
  Published：25 October 2015
- 稿件说明：
移动端阅览
Tao YOU, Qi-man WU, Chuan-wen WANG, et al. Vector subscriptions and sharing mechanism for content-based publish/subscribe system[J]. Journal on Communications, 2015, 36(10): 101-109.
DOI：

Tao YOU, Qi-man WU, Chuan-wen WANG, et al. Vector subscriptions and sharing mechanism for content-based publish/subscribe system[J]. Journal on Communications, 2015, 36(10): 101-109. DOI： 10.11959/j.issn.1000-436x.2015191.

摘要

在分析典型索引结构和树型结构匹配算法变更特性、匹配效率的基础上，以匹配效率高的匹配树算法为基础，扩展其订阅结构为向量结构，提出了向量变更算法。基于向量间的关联关系，提出了向量共享算法，从而有效降低订阅变更对匹配树重构的影响，提高了订阅处理效率。理论分析和实验表明，与已有订阅变更方式相比，该方法能够在满足频繁订阅变更的同时提供高效的事件匹配，满足相关应用的要求。

Abstract

The concept of vector subscriptions to support subscription adaptations was introduced.Novel algorithms were proposed for updating vector subscriptions in classic matching tree structures

and was presented sharing algorithms for vector subscriptions.These algorithms effectively reduce the impact of subscription changes in matching tree structures.Compared to re-subscriptions method

the algorithms significantly reduce the reaction time to subscription updates and can sustain higher throughput in the presence of high update rates.

关键词

Keywords

references

LI M , YE F , KIM M , et al . A scalable and elastic publish/subscribe service [A ] . Proceeding of Parallel ＆ Distributed Processing Symposium [C ] . Anchorage,AK , 2011 . 1254 - 1265 .

SCHOLTUS M , VAN D D , FRIJNS B . Speed,algorithmic trading,and market quality around macroeconomic news announcements [J ] . Journal of Banking ＆ Finance , 2014 , 38 ( c ): 89 - 105 .

AVAIDA M , BARHOURNI M , FOUCHAL H , et al . Joint routing and location-based service in VANET [J ] . Journal of Parallel and Distributed Computing , 2014 , 74 ( 2 ): 2077 - 2087 .

JUSTIR C , ERAN T , JASON H , et al . Bridging the gap between physical location and online social networks [A ] . Proceedings of the 12th ACM International Conference on Ubiquitous Computing [C ] . New York,USA , 2010 . 119 - 128 .

LI Z , LI X , DUONG T A , et al . Accelerating optimistic HLA-based simulations in virtual execution environments [A ] . Proceedings of the 2013 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation [C ] . New York,USA , 2013 . 211 - 220 .

SADOGHI M , JACOBSEN H A . Be-tree:an index structure to efficiently match boolean expressions over high-dimensional discrete space [A ] . Proceedings of 37th SIGMOD International Conference on Management of Data [C ] . New York,USA , 2011 . 637 - 648 .

SHEN Z H , TIRTHAPURA S , ALURU S . Indexing for subscription covering in publish-subscribe systems [A ] . Proceedings of IEEE International Conference on Data Engineering [C ] . Piscataway , 2005 . 32 - 43 .

陈继明 , 鞠时光 , 潘金贵 , 等 . 基于内容的快速事件匹配算法 [J ] . 通信学报 , 2011 , 32 ( 6 ): 78 - 85 .

CHEN J M , JU S G , PAN J G , et al . Content-based effective event matching algorithm [J ] . Journal on Communications , 2011 , 32 ( 6 ): 78 - 85 .

KAZEMZADEH R S , JACOBSEN H A . Opportunistic multipath forwarding in content-based publish/subscribe overlays [A ] . Proceedings of the 13th International Middleware Conference [C ] . New York,USA , 2012 . 249 - 270 .

ZJGOR S , AURKENE A , MIKEL L , et al . Mobile xsiena:towards mobile publish/subscribe [A ] . Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems [C ] . New York,USA , 2010 . 91 - 92 .

SILVIA B , PASCAL F , MARIA G . Content-based publish/subscribe using distributed R-trees [A ] . Proceedings of International Conference on Parallel and Distributed Computing [C ] . Berlin,Germany , 2007 . 537 - 548 .

CARZANIGA A , ROSENBLUM D S , WOLF A L . Design and evaluation of a wide-area event notification service [J ] . ACM Transactions on Computer Systems(TOCS) , 2001 , 19 ( 3 ): 332 - 383 .

JAYARAM K R , JAYALATH C , EUGSTER P . Parametric subscriptions for content-based publish/subscribe networks [A ] . Proceedings of Middleware 2010 [C ] . Bangalore,India , 2010 . 128 - 147 .

JAYARAM K R , JAYALATH C , EUGSTER P . Parametric content-based publish/subscribe [J ] . ACM Transactions on Computer Systems(TOCS) , 2013 , 31 ( 2 ): 491 - 501 .

Views

2243

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

EAEBHCM:an extended attribute encryption based hidden credentials model

Model for attribute based access control

Related Author

Wei-jin GE

Xiao-hui HU

LI Xiao-feng1～4

FENG Deng-guo1

CHEN Zhao-wu3

FANG Zi-he4

Related Institution

Institute of Software,Chinese Academy of Sciences

State Key Laboratory of Information Security,Institute of Software of Chinese Academy of Sciences

AI问答

⁰