Routing and load balancing techniques for a content-based publish/subscribe system

Efficient routing in the large-scale system and load balancing with non-uniform distribution of events are two key problems to be addressed for content-based publish/subscribe systems. K-D tree partition method is used to realize static load balancing among event space regions. On this basis, with the index mechanism in K-D trees, a hierarchical routing among event brokers was designed for the content-based publish/subscribe system. This routing algorithm efficiency is up to O(lnN). Based on the two characteristics of content-based publish/subscribe system load, which are region matching load and routing load, region splitting and replicating methods were used to transfer its loads between brokers correspondently. After that, two schemes which were forwarded join and dynamic detection are come up with to realize dynamic load balancing. Performance analysis and simulation experiments show that the introduction of those solutions addressed routing efficiency and load balancing problems for content-based publish/subscribe system.