Most of currently available content-based publish-subscribe systems that were designed to operate in large scale, wired scenarios, build their routing infrastructure as a set of brokers connected in an acyclic network. The topology of such network is critical for the performance of the system. Depending on the traffic profile, the same topology may provide good performance or be very inefficient. Starting from this consideration, in this paper we first analyze this issue in detail, then we describe a distributed algorithm to address it, by adapting the topology of a content-based publish-subscribe routing network to the application demand.
In another work REF , a distributed algorithm to solve the problem of optimal content-based routing (OCBR) was proposed.
Adapting publish-subscribe routing to traffic demands
DEBS '07
Computer Science