Load Balancing Content-Based Publish/Subscribe Systems

被引:28
作者
Cheung, Alex King Yeung [1 ]
Jacobsen, Hans-Arno [1 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
来源
ACM TRANSACTIONS ON COMPUTER SYSTEMS | 2010年 / 28卷 / 04期
基金
加拿大自然科学与工程研究理事会; 加拿大创新基金会;
关键词
Algorithms; Experimentation; Performance; Publish/subscribe; content-based routing; load balancing; load estimation; subscriber migration; offload algorithms; PADRES; ToPSS; PUBLISH-SUBSCRIBE;
D O I
10.1145/1880018.1880020
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Distributed content-based publish/subscribe systems suffer from performance degradation and poor scalability caused by uneven load distributions typical in real-world applications. The reason for this shortcoming is the lack of a load balancing scheme. This article proposes a load balancing solution specifically tailored to the needs of content-based publish/subscribe systems that is distributed, dynamic, adaptive, transparent, and accommodates heterogeneity. The solution consists of three key contributions: a load balancing framework, a novel load estimation algorithm, and three offload strategies. A working prototype of our solution is built on an open-sourced content-based publish/subscribe system and evaluated on PlanetLab, a cluster testbed, and in simulations. Real-life experiment results show that the proposed load balancing solution is efficient with less than 0.2% overhead; effective in distributing and balancing load originating from a single server to all available servers in the network; and capable of preventing overloads to preserve system stability, availability, and quality of service.
引用
收藏
页数:55
相关论文
共 74 条
[1]   Channelization problem in large scale data dissemination [J].
Adler, M ;
Ge, ZH ;
Kurose, JF ;
Towsley, D ;
Zabele, S .
NETWORK PROTOCOLS, 2001, :100-109
[2]  
Aekaterinidis I., 2006, P 26 IEEE INT C DIST, P23
[3]  
ALEKSY M, 2001, P INT C PAR DISTR PR
[4]  
ALTINEL M., 2000, VLDB 2000 P 26 INT C, P53
[5]  
[Anonymous], P 14 ACM S OP SYST P
[6]  
[Anonymous], PEER TO PEER APPROAC
[7]  
[Anonymous], 1999, KDD, DOI [10.1145/312129.312195, DOI 10.1016/J.EC0LENG.2010.11.031]
[8]  
[Anonymous], P 5 ACM IFIP USENIX
[9]   Content-based publish-subscribe over structured overlay networks [J].
Baldoni, R ;
Marchetti, C ;
Virgillito, A ;
Vitenberg, R .
25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2005, :437-446
[10]  
Baldoni R., 2007, DEBS, P2