基于内容的发布/订阅中基于订阅-覆盖的路由算法

IF 0.6 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Yuan Liang, Guo Chang-guo, Zou Peng
{"title":"基于内容的发布/订阅中基于订阅-覆盖的路由算法","authors":"Yuan Liang, Guo Chang-guo, Zou Peng","doi":"10.1108/17427370910950294","DOIUrl":null,"url":null,"abstract":"Purpose – The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.Design/methodology/approach – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.Findings – Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.Research limitations/implications – All these experiments are based on high speed wireline network. For wireless network, the results may be different.Originality/value – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than...","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17427370910950294","citationCount":"2","resultStr":"{\"title\":\"The subscription‐cover‐based routeing algorithm in content‐based publish/subscribe\",\"authors\":\"Yuan Liang, Guo Chang-guo, Zou Peng\",\"doi\":\"10.1108/17427370910950294\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Purpose – The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.Design/methodology/approach – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.Findings – Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.Research limitations/implications – All these experiments are based on high speed wireline network. For wireless network, the results may be different.Originality/value – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than...\",\"PeriodicalId\":43952,\"journal\":{\"name\":\"International Journal of Pervasive Computing and Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2009-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1108/17427370910950294\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Pervasive Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/17427370910950294\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Pervasive Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/17427370910950294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 2

摘要

目的——发布/订阅模式对互联网上的内容传播很有用。本文的目的是提出订阅覆盖,以减少路由表的大小和通知匹配时间。设计/方法/方法-本文提出了使用SSCBR算法时正确配置路由表的充分必要条件。研究结果-实验表明,SSCBR和RSCBR都可以减少路由表的大小,减少网络流量和时间。研究局限/启示-所有这些实验都是基于高速有线网络。对于无线网络,结果可能会有所不同。独创性/价值——本文提出了使用SSCBR算法时路由表配置正确的充分必要条件,通过它可以方便地验证代理路由表的正确性。由于RSCBR计算的订阅覆盖关系较少,因此其在网络流量中的性能和平均通知处理时间都优于传统的RSCBR。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The subscription‐cover‐based routeing algorithm in content‐based publish/subscribe
Purpose – The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.Design/methodology/approach – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.Findings – Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.Research limitations/implications – All these experiments are based on high speed wireline network. For wireless network, the results may be different.Originality/value – The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than...
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Pervasive Computing and Communications
International Journal of Pervasive Computing and Communications COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
6.60
自引率
0.00%
发文量
54
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信