{"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}
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...