The subscription‐cover‐based routeing algorithm in content‐based publish/subscribe

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 SSCBR in certain scenarios.

Citation

Hong Liang, Y., ChangGuo, G. and Peng, Z. (2009), "The subscription‐cover‐based routeing algorithm in content‐based publish/subscribe", International Journal of Pervasive Computing and Communications, Vol. 5 No. 1, pp. 25-41. https://doi.org/10.1108/17427370910950294