|
|
Load balancing algorithms of semantic publish/subscribe system over structured P2P networks |
QIAN Jian-feng, YIN Jian-wei, DONG Jin-xiang |
School of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China |
|
|
Abstract A dynamic load balancing algorithm of semantic publish/subscribe system over structured P2P networks was proposed by combining characteristics of the distributed publish/subscribe system with advantages of current structured P2P (peer-to-peer) load balancing algorithms. Ontology provided semantic support. Concepts of ontology class weight, broker weight and virtual subscription were defined. Weighted ontology class tree was mapped to the weighted broker network. Brokers managed virtual subscriptions, and ontology routing table maintained the mapping information. Events and subscriptions in accordance with their ontology information were assigned to different brokers. Then the system achieved semanticbased division of the structured P2P network and large-scale distributed computing and matching capabilities. Weights of ontology classes and brokers can be dynamically adjusted, and brokers can exchange or transfer the virtual subscriptions when overloaded. Thereby the system obtained efficient load balancing. Experimental results show that the load balancing algorithms significantly increase the capacity of the broker network and achieve good scalability and good tradeoff of network resource consumption.
|
Published: 01 October 2011
|
|
结构化P2P网络的语义发布/订阅系统 负载均衡算法
针对分布式发布/订阅系统的特点,结合结构化P2P网络负载均衡算法的优点,实现了一种基于结构化P2P网络的语义发布/订阅系统的负载均衡算法.采用本体支持语义,定义本体类权重、节点权重、虚拟订阅等概念,将本体类权重树映射到代理权重网络.由代理节点管理虚拟订阅,本体路由表维护映射信息.事件和订阅根据其本体信息被分配到不同的代理节点上.实现了对结构化P2P网络的基于语义的划分,达到分布式计算和匹配的目的.在此基础上,提出一种动态负载均衡算法:动态调整本体类权重及代理节点的权重,在代理节点负载过载时,进行虚拟订阅的交换或迁移,使得系统获得高效的负载均衡.实验结果表明,负载均衡算法显著地改善了结构化P2P代理网络的可用容量,具有良好的可扩展性,在网络资源消耗方面取得了良好的平衡效果.
|
|
[1] PETROVIC M, BURCEA I, JACOBSEN H A. SToPSS: semantic toronto publish/subscribe system [C]∥Proceedings of the 29th VLDB Conference. Heidelberg: Springer, 2003: 1101-1104. [2] CHIRITA P A, IDREOS S, KOUBARAKIS M, et al. Publish/subscribe for RDFbased P2P networks [C]∥Proceedings of the 1st European Semantic Web Symposium. Heidelberg: Springer, 2004: 182-197. [3] PETROVIC M, LIU Haifeng, JACOBSEN H A. GToPSS: fast filtering of graphbased metadata [C]∥Proceedings of the 14th International Conference on World Wide Web. New York: ACM, 2005: 539-547. [4] 汪锦岭.面向Internet 的发布/订阅系统的关键技术研究[D]. 北京:中国科学院软件研究所,2005. WANG Jinling. Research on key technologies in Internetscale publish/subscribe systems [D]. Beijing: Institute of Software, Chinese Academy of Sciences, 2005. [5] 尹建伟,施冬材,钱剑锋,等.结构化P2P 网络上语义发布/订阅事件路由算法[J].浙江大学学报:工学版,2008,42(9): 1616-1624. YIN Jianwei, SHI Dongcai, QIAN Jianfeng, et al. Event routing algorithms of semantic publish/subscribe over structured P2P networks [J]. Journal of Zhejiang University: Engineering Science, 2008, 42(9): 1616-1624. [6] QIAN Jianfeng, YIN Jianwei, Dong Jinxiang. Exploring a semantic publish/subscribe middleware for eventbased SOA [C]∥Proceedings of IEEE AsiaPacific Services Computing Conference. Virgin Island: IEEE, 2008: 1269-1275. [7] TERPSTRA W W, KANGASHARJU J, LENG C, et al. Bubblestorm: resilient, probabilistic, and exhaustive peertopeer search [C]∥Proceedings of ACM SIGCOMM. New York: ACM, 2007: 49-60. [8] WONG B, GUHA S. Quasar: a probabilistic publishsubscribe system for social networks [C]∥Proceedings of IPTPS. Berkeley: USENIX Association, 2008. [9] GKANTSIDIS C, MIHAIL M, SABERI A. Random walks in peertopeer networks: algorithms and evaluation [J]. Performance Evaluation, 2006, 63(3): 241-263. [10] CASTRO M, DRUSCHEL P, KERMARREC A, et al. SCRIBE: a largescale and decentralized applicationlevel multicast infrastructure [J]. IEEE Journal on Selected Areas in Communications (JSAC), 2002, 20(8): 1489-1499. [11] GUPTA A, SAHIN O D, AGRAWAL D, et al. Meghdoot: contentbased publish/subscribe over p2p networks [C]∥Proceedings of Middleware. Heidelberg: Springer, 2004: 254-273. [12] TRIANTAFILLOU P, AEKATERINIDIS I. Contentbased publishsubscribe over structured P2P networks [C]∥Proceedings of DEBS. New York : ACM, 2003: 104-109. [13] KARTHIK A R, LAKSHMINARAYANAN K, SURANA S, et al. Load balancing in structured P2P systems \ [J\]. Lecture Notes in Computer Science, 2003, 2735: 68-79. [14] GODFREY B, LAKSHMINARAYANAN K, SURANA S, et al. Load balancing in dynamic structured P2P systems [C]∥Proceedings of IEEE INFOCOM. New York :IEEE, 2004: 2253-2262. [15] KARGER D, RUHL M. Simple efficient load balancing algorithms for peertopeer systems [J]. Theory of Computing Systems, 2006, 39(6): 787-804. [16] BYERS J, CONSIDINE J, MITZENMACHER M. Simple load balancing for distributed hash tables [C]∥Proceedings of IPTPS. Heidelberg: Springer, 2003: 80-87. [17] LEDLIE J, SELTZER M. Distributed, secure load balancing with skew, heterogeneity, and churn [C]∥Proceedings of IEEE INFOCOM. New York: IEEE, 2005: 1419-1430. [18] GUPTA A, SAHIN O D, AGRAWAL D, et al. Meghdoot: contentbased publish/subscribe over P2P networks [C]∥Proceedings of Middleware. Heidelberg: Springer, 2004: 254-273. [19] CHEN Y, SCHWAN K. Opportunistic overlays: efficient content delivery in mobile ad hoc networks [C]∥Proceedings of Middleware. Heidelberg: Springer, 2005: 354-374. [20] CHEUNG A K Y, JACOBSEN H A. Dynamic load balancing in distributed contentbased publish/subscribe [C]∥Proceedings of Middleware. Heidelberg: Springer, 2006: 141-161. [21] ZHANG Hui, GANGULY S, BHATNAGAR S. Optimal load balancing in publish/subscribe broker networks using active workload management [C]∥Proceedings of ICC. Virgin Island: IEEE, 2008: 5892-5896.
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|