{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:19Z","timestamp":1754157919888,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2009,4,3]],"date-time":"2009-04-03T00:00:00Z","timestamp":1238716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4,3]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>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.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>All these experiments are based on high speed wireline network. For wireless network, the results may be different.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>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 SSCBR in certain scenarios.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370910950294","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T05:19:27Z","timestamp":1240809567000},"page":"25-41","source":"Crossref","is-referenced-by-count":2,"title":["The subscription\u2010cover\u2010based routeing algorithm in content\u2010based publish\/subscribe"],"prefix":"10.1108","volume":"5","author":[{"given":"Yuan","family":"Hong Liang","sequence":"first","affiliation":[]},{"given":"Guo","family":"ChangGuo","sequence":"additional","affiliation":[]},{"given":"Zou","family":"Peng","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022031120053622000_b1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M. and Chandra, T.D. (1999), \u201cMatching events in a content\u2010based subscription system\u201d, Proceedings of the ACM PODC, Atlanta, GA, pp. 53\u201061.","DOI":"10.1145\/301308.301326"},{"key":"key2022031120053622000_b2","unstructured":"Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R.E. and Sturman, D.C. (1999), \u201cAn efficient multicast protocol for content\u2010based publish\u2010subscribe systems\u201d, Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, pp. 262\u201072."},{"key":"key2022031120053622000_b3","unstructured":"Cao, F.Y. and Singh, J.P. (2004), \u201cEfficient event routing in content\u2010based publish\u2010subscribe service networks\u201d, Proceedings of the IEEE INFOCOM, Hong Kong."},{"key":"key2022031120053622000_b4","doi-asserted-by":"crossref","unstructured":"Carzaniga, A. and Wolf, A.L. (2003), \u201cForwarding in a content\u2010based network\u201d, Proceedings of the ACM SIGCOMM'03, Karlsruhe, pp. 25\u20109.","DOI":"10.1145\/863955.863975"},{"key":"key2022031120053622000_b5","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Rosenblum, D.S. and Wolf, A.L. (2001), \u201cDesign and evaluation of a wide\u2010area event notification service\u201d, ACM Transactions on Computer Systems, Vol. 19 No. 3, pp. 332\u201083.","DOI":"10.1145\/380749.380767"},{"key":"key2022031120053622000_b6","doi-asserted-by":"crossref","unstructured":"Courtenage, S. and Williams, S. (2005), \u201cAutomatic hyperlink creation using P2P and publish\/subscribe\u201d, The Workshop on Peer\u2010to\u2010Peer and Agent Infrastructures for Knowledge Management (PAIKM), April.","DOI":"10.1007\/11590019_26"},{"key":"key2022031120053622000_b7","unstructured":"Cugola, G., Nitto, E.D. and Fugetta, A. (1998), \u201cExploiting an event\u2010based infrastructure to develop complex distributed systems\u201d, Proceedings of the 20th International Conference on Software Engineering, Kyoto, April."},{"key":"key2022031120053622000_b8","doi-asserted-by":"crossref","unstructured":"Cugola, G., Nitto, E.D. and Fugetta, A. (2001), \u201cThe JEDI event\u2010based infrastructure and its application to the development of the OPSS WFMS\u201d, IEEE Transactions on Software Engineering, Vol. 27 No. 9, April, pp. 827\u201050.","DOI":"10.1109\/32.950318"},{"key":"key2022031120053622000_b9","doi-asserted-by":"crossref","unstructured":"Eugster, P.T., Felber, P., Guerraoui, R. and Kermarrec, A.M. (2003), \u201cThe many faces of publish\/subscribe\u201d, ACM Journal of Computing, Vol. 35 No. 2, March, pp. 114\u201031.","DOI":"10.1145\/857076.857078"},{"key":"key2022031120053622000_b10","doi-asserted-by":"crossref","unstructured":"Fabret, F., Jacobsen, H., Llirbat, F., Pereira, J., Ross, K. and Shasha, D. (2001), \u201cFiltering algorithms and implementations for very fast publish\/subscribe systems\u201d, Proceedings of ACM SIGMOD, Santa Barbara, CA, pp. 115\u201026.","DOI":"10.1145\/376284.375677"},{"key":"key2022031120053622000_b11","unstructured":"Ge, Z., Adler, M., Kurose, J., Towsley, D. and Zabele, S. (2001), \u201cChannelization problem in large\u2010scale data dissemination\u201d, technical report, University of Massachusetts\u2010Amherst, Amherst, MA."},{"key":"key2022031120053622000_b12","unstructured":"Hall, C.P., Carzaniga, A., Rose, J. and Wolf, A.L. (2004), \u201cA content\u2010based networking protocol for sensor networks\u201d, technical report, August, Department of Computer Science, University of Colorado, Boulder, CO."},{"key":"key2022031120053622000_b13","unstructured":"IBM Corporation (2001), \u201cGryphon: publish\/subscribe over public networks\u201d, technical report, IBM T.J. Watson Research Center, Yorktown Heights, NY."},{"key":"key2022031120053622000_b14","unstructured":"Keidl, M., Kreutz, A., Kemper, A. and Kossman, D. (2002), \u201cA publish\/subscribe architecture for distributed metadata management [A]\u201d, in Georgakopoulos, D., Agrawal, R. and Dittrich, K. (Eds), Proceedings of the 18th International Conference on Data Engineering (ICDE'02), IEEE Computer Society, San Jose, CA."},{"key":"key2022031120053622000_b15","unstructured":"Li, G.L., Hou, S. and Jacobsen, H.A. (2005), \u201cA unified approach to routing, covering and merging in publish\/subscribe systems based on modified binary decision diagrams\u201d, Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), pp. 447\u201057."},{"key":"key2022031120053622000_b16","unstructured":"Lin, J.C. and Paul, S. (1996), \u201cA reliable multicast transport protocol\u201d, Proceedings of the INFOCOM, pp. 1414\u201024."},{"key":"key2022031120053622000_b17","unstructured":"Liu, Y. and Plale, B. (2003), \u201cSurvey of publish\/subscribe event systems\u201d, Technical Report No. TR574, May, Department of Computer Science, (CSCI), Indiana University, Bloomington, IN."},{"key":"key2022031120053622000_b18","unstructured":"Marchetti, C., Mecella, M., Scannapieco, M. and Virgillito, A. (2003), \u201cEnabling data quality notification in cooperative information systems through a web\u2010service based architecture\u201d, Proceedings of the 4th International Conference on Web Information Systems Engineering, Roma."},{"key":"key2022031120053622000_b19","unstructured":"Muhl, G. (2002), \u201cLarge\u2010scale content\u2010based publish\/subscribe systems\u201d, PhD thesis, Technical University of Darmstadt, Darmstadt."},{"key":"key2022031120053622000_b20","unstructured":"OMNeT++Web page, available at: www.omnetpp.org\/"},{"key":"key2022031120053622000_b21","doi-asserted-by":"crossref","unstructured":"Opyrchal, L., Astley, M., Auerbach, J.S., Banavar, G., Strom, R. E. and Sturman, D.C. (2000), \u201cExploiting IP multicast in content\u2010based publish\u2010subscribe systems\u201d, Proceedings of Middleware 2000, New York, NY, April.","DOI":"10.1007\/3-540-45559-0_10"},{"key":"key2022031120053622000_b22","doi-asserted-by":"crossref","unstructured":"Raghunathan, V., Schurgers, C., Park, S. and Srivastava, M.B. (2002), \u201cEnergy\u2010aware wireless microsensor networks\u201d, IEEE Signal Processing Magazine, Vol. 19 No. 2, March, pp. 40\u201050.","DOI":"10.1109\/79.985679"},{"key":"key2022031120053622000_b23","unstructured":"Riabov, A., Liu, Z., Wolf, J., Yu, P. and Zhang, L. (2002), \u201cClustering algorithms for content\u2010based publication\u2010subscription systems\u201d, Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS'02)."},{"key":"key2022031120053622000_b24","doi-asserted-by":"crossref","unstructured":"Triantafillou, P. and Aekaterinidis, I. (2004), \u201cContent\u2010based publish\u2010subscribe over structured P2P networks\u201d, International Workshop on Distributed Event\u2010Based Systems (DEBS04), Edinburgh, 24\u201025 May.","DOI":"10.1049\/ic:20040391"},{"key":"key2022031120053622000_b25","unstructured":"Wong, T., Katz, R. and Canne, S.M. (2000), \u201cAn evaluation of preference clustering in large scale multicast applications\u201d, Proceedings of IEEE INFOCOM, March."},{"key":"key2022031120053622000_b26","doi-asserted-by":"crossref","unstructured":"Xue, T. and Feng, B.Q. (2005), \u201cResearch on routing algorithm and self\u2010configuration in content\u2010based publish\u2010subscribe system\u201d, Journal of Software, Vol. 16 No. 2, pp. 251\u20109.","DOI":"10.1360\/jos160251"},{"key":"key2022031120053622000_b27","doi-asserted-by":"crossref","unstructured":"Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R. and Kubiatowicz, J. (2001), \u201cBayeux: an architecture for scalable and fault\u2010tolerant wide\u2010area data dissemination\u201d, Proceedings of International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV).","DOI":"10.1145\/378344.378347"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370910950294","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910950294\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370910950294\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:12Z","timestamp":1753403052000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/1\/25-41\/161540"}},"subtitle":[],"editor":[{"given":"J.H.","family":"Abawajy","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2009,4,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4,3]]}},"alternative-id":["10.1108\/17427370910950294"],"URL":"https:\/\/doi.org\/10.1108\/17427370910950294","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,4,3]]}}}