Key algorithm in content-based publish/subscribe system based on subscription partitioning

Partitioning subscriptions interest among multi-brokers acts as an important way to resolve load balancing problem in content-based publish/subscribe system. A new method of event space-based subscription partition with K-D tree was proposed. With this method, the event space was partitioned into zones with equal load and so the system performance of load balancing was improved. Based on the minimum distance of logical event space, new routing algorithms were proposed for event and subscription routing and another hybrid of unicast and multicast routing policy for notification routing. All these algorithms and policy significantly reduced the event matching cost and promoted the routing efficiency in content-based publish/subscribe system. At the same time, the method of splitting and merging zones of event space was used to realize the self-organizing of the publish/subscribe system. The experiment and related works show that the introduction of partitioning methods and related algorithms can improve the scalability, fault tolerant and load balancing performance of content-based publish/subscribe system.