TY - GEN
T1 - MERC
T2 - 16th International Middleware Conference, Middleware 2015
AU - Ji, Shuping
AU - Ye, Chunyang
AU - Wei, Jun
AU - Jacobsen, Hans Arno
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/11/24
Y1 - 2015/11/24
N2 - Despite suffering from ineficiency and flexibility limitations, the filter-based routing (FBR) algorithm is widely used in content-based publish/subscribe (pub/sub) systems. To address its limitations, we propose a dynamic destination-based routing algorithm called D-DBR, which decomposes pub/sub into two independent parts: Content-based matching and destination-based multicasting. D-DBR exhibits low event matching cost and high eficiency, flexibility, and robustness for event routing in small scale overlays. To boost scalability, we further complement D-DBR with a new routing algorithm called MERC. MERC divides the overlay into interconnected clusters and applies content-based and destinationbased mechanisms to route events inter- and intra-cluster, respectively. We implemented all algorithms in the PADRES pub/sub system. Experimental results show that our algorithms outperform FBR in terms of improving event dissemination throughput by up to 700% and reducing the end-toend latency by up to 55%.
AB - Despite suffering from ineficiency and flexibility limitations, the filter-based routing (FBR) algorithm is widely used in content-based publish/subscribe (pub/sub) systems. To address its limitations, we propose a dynamic destination-based routing algorithm called D-DBR, which decomposes pub/sub into two independent parts: Content-based matching and destination-based multicasting. D-DBR exhibits low event matching cost and high eficiency, flexibility, and robustness for event routing in small scale overlays. To boost scalability, we further complement D-DBR with a new routing algorithm called MERC. MERC divides the overlay into interconnected clusters and applies content-based and destinationbased mechanisms to route events inter- and intra-cluster, respectively. We implemented all algorithms in the PADRES pub/sub system. Experimental results show that our algorithms outperform FBR in terms of improving event dissemination throughput by up to 700% and reducing the end-toend latency by up to 55%.
KW - Content-based publish/subscribe
KW - Destination-based multicasting
KW - Event processing
KW - Event routing
UR - http://www.scopus.com/inward/record.url?scp=84966781478&partnerID=8YFLogxK
U2 - 10.1145/2814576.2814801
DO - 10.1145/2814576.2814801
M3 - Conference contribution
AN - SCOPUS:84966781478
T3 - Middleware 2015 - Proceedings of the 16th Annual Middleware Conference
SP - 13
EP - 24
BT - Middleware 2015 - Proceedings of the 16th Annual Middleware Conference
PB - Association for Computing Machinery, Inc
Y2 - 7 December 2015 through 11 December 2015
ER -