摘要
研究在非均匀数据分布情况下的负载均衡和大规模系统中的事件路由效率问题.使用K-D树划分结构实现了内容发布/订阅系统的静态负载均衡.在此基础上,利用K-D树的索引机制,实现了系统事件代理之间的分层路由机制,将路由效率提高到O(lnN).基于区域匹配和路由2种负载特征,采用区域分裂和复制方法实现代理之间的负载调度.通过转移加入和动态探测的方法解决了动态负载均衡问题.性能分析和仿真实验表明,上述方法解决了基于事件空间划分的内容发布/订阅系统的高效路由和负载均衡问题.
Efficient routing in the large-scale system and load balancing with non-uniform distribution of events are two key problems to be addressed for content-based publish/subscribe systems.K-D tree partition method is used to realize static load balancing among event space regions.On this basis,with the index mechanism in K-D trees,a hierarchical routing among event brokers was designed for the content-based publish/subscribe system.This routing algorithm's efficiency is up to O(lnN).Based on the two characteristics of content-based publish/subscribe system load,which are region matching load and routing load,region splitting and replicating methods were used to transfer its loads between brokers correspondently.After that,two schemes which were forwarded join and dynamic detection are come up with to realize dynamic load balancing.Performance analysis and simulation experiments show that the introduction of those solutions addressed routing efficiency and load balancing problems for content-based publish/subscribe system.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2006年第11期969-973,共5页
Transactions of Beijing Institute of Technology
基金
国家自然科学基金资助项目(90412011)
关键词
发布/订阅
路由
负载均衡
网络
publish/subscribe
routing
load balancing
network
