Research on Routing Algorithm Based on Subscription Covering in Content-Based Publish/Subscribe
Yuan Hong · Chinese Journal of Computers · 2006
Subscription covering has been proposed to reduce the size of routing table in intermediate brokers in the publish/subscribe network.Existing research have two insufficiencies.First,they neglect the extent that covering can be applied.Second,they don't give a simple approach to validate the correctness of routing table when using subscription covering.In this paper,according to the difference of applying subscription covering,the authors propose two routing algorithms: strict subscription-cover based routing(SSCBR) and relaxed subscription-cover based routing(RSCBR).The goal of the former is to maintain the least covered subscriptions.The latter maintains more covered subscription to balance the cost in memory,time and network traffic.On the other hand,the authors propose a necessary and sufficient condition of correct routing table configuration when using SSCBR algorithm.Tthe correctness of broker's routing table can be easily validated through it.Experiments evaluate the behavior of two algorithms in reducing routing table size,network traffic and time.