Practical High-Throughput Content-Based Routing Using Unicast State and Probabilistic Encodings
Antonio Carzaniga, Cyrus Hall, Giovanni Toffetti, Alexander L. Wolf · reroDoc Digital Library · 2009
We address the problem that existing publish/subscribe messaging systems, including such commonly used ones as Apache’s ActiveMQ and IBM’s WebSphere MQ, exhibit degraded end-to-end throughput performance in a wide-area network setting. We contend that the cause of this problem is the lack of an appropriate routing protocol. Building on the idea of a content-based network, we introduce a protocol called B-DRP that can demonstrably improve the situation. A content-based network is a content-based publish/subscribe system architected as a datagram network: a message is forwarded hop-by-hop and delivered to any and all hosts that have expressed interest in the message content. This fits well with the character of a wide-area messaging system. B-DRP is based on two main techniques: a message delivery mechanism that utilizes and exploits unicast forwarding state, which can be easily maintained using standard protocols, and a probabilistic data structure to efficiently represent and evaluate receiver interests. We present the design of B-DRP and the results of an experimental evaluation that demonstrates its support for improved throughput in a wide-area setting. Publish/subscribe messaging is a central feature of modern enterprise computing platforms. They are typically based on high-performance implementations of the Java Message Service (JMS). 1 Examples include IBM’s Web-