Exactly-once delivery in a content-based publish-subscribe system

被引:38
作者
Bhola, S [1 ]
Strom, R [1 ]
Bagchi, S [1 ]
Zhao, YY [1 ]
Auerbach, J [1 ]
机构
[1] IBM Corp, TJ Watson Res Ctr, Armonk, NY 10504 USA
来源
INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS | 2002年
关键词
D O I
10.1109/DSN.2002.1028881
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a general knowledge model for propagating information in a content-based publish-subscribe system. The model is used to derive an efficient and scalable protocol for exactly-once delivery to large numbers (tens of thousands per broker) of content-based subscribers in either publisher order or uniform total order Our protocol allows intermediate content filtering at each hop, but requires persistent storage only at the publishing site. It is tolerant of message drops, message reorderings, node failures, and link failures, and maintains only "soft" state at intermediate nodes. We evaluate the performance of our implementation both under failure-free conditions and with fault injection.
引用
收藏
页码:7 / 16
页数:10
相关论文
共 15 条
[1]  
Aguilera M. K., 1999, Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, P53, DOI 10.1145/301308.301326
[2]  
AGUILERA MK, 2000, P 19 ACM S PRINC DIS
[3]  
[Anonymous], 1998, THESIS POLITECNICO M
[4]  
[Anonymous], 1988, ACM SIGCOMM COMPUTER
[5]   An efficient multicast protocol for content-based publish-subscribe systems [J].
Banavar, G ;
Chandra, T ;
Mukherjee, B ;
Nagarajarao, J ;
Strom, RE ;
Sturman, DC .
19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1999, :262-272
[6]  
BIRMAN K, 1991, ACM T COMPUT SYST, V9, P272, DOI 10.1145/128738.128742
[7]  
FLOYD S, 1996, IEEE ACM T NETWO NOV
[8]  
Lin JC, 1996, IEEE INFOCOM SER, P1414, DOI 10.1109/INFCOM.1996.493090
[9]  
PIANTONI R, 1997, S FAULT TOL COMP FTC, P309
[10]  
RAMAN S, 1999, P ACM SIGCOMM, P15