Volume 32 Issue 08
Aug.  2006
Turn off MathJax
Article Contents
Lu Peng, Liu Xudong, Lin Xuelian, et al. Key algorithm in content-based publish/subscribe system based on subscription partitioning[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(08): 992-997. (in Chinese)
Citation: Lu Peng, Liu Xudong, Lin Xuelian, et al. Key algorithm in content-based publish/subscribe system based on subscription partitioning[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(08): 992-997. (in Chinese)

Key algorithm in content-based publish/subscribe system based on subscription partitioning

  • Received Date: 10 Oct 2005
  • Publish Date: 31 Aug 2006
  • Partitioning subscriptions interest among multi-brokers acts as an important way to resolve load balancing problem in content-based publish/subscribesystem. A new method of event space-based subscription partition with K-D tree was proposed. With this method, the event space was partitioned into zones with equal load and so the system performance of load balancing was improved. Based on the minimum distance of logical event space, new routing algorithms were proposed for event and subscription routing and another hybrid of unicast and multicast routing policy for notification routing. All these algorithms and policy significantly reduced the event matching cost and promoted the routing efficiency in content-based publish/subscribe system. At the same time, the method of splitting and merging zones of event space was used to realize the self-organizing of the publish/subscribe system. The experiment and related works show that the introduction of partitioning methods and related algorithms can improve the scalability, fault tolerant and load balancing performance of content-based publish/subscribe system.

     

  • loading
  • [1] Eugster P Th,Felber P A,Guerraoui R,et al. The many faces of publish/subscribe[J].ACM Comput Surv,2003,35(2):114-131 [2] Fitzpatrick G,Kaplan S,Mansfield T, et al. Supporting public availability and accessibility with Elvin:experiences and reflections[J]. Comput Supported Coop Work CSCW Int J,2002,11(3-4):447-474 [3] IBM Corporation. Achieving scalability and throughput in a publish/subscribe system . RC23103(W0402-026),2004 [4] Carzaniga A,Rosenblum D S,Wolf A L.Design and evaluation of a wide-area event notification service[J]. ACM Trans Comput Syst, 2001,19(3):332-383 [5] Cugola G,Di Nitto E,Fuggetta A.The JEDI event-based infrastructure and its application to the development of the OPSS WFMS[J]. IEEE Trans Software Eng,2001,27(9):827-850 [6] 薛涛,冯博琴.内容发布订阅系统路由算法和自配置策略研究[J].软件学报,2005,16(2):251-259 Xue Tao,Feng Boqin.Research on routing algorithm and self-configuration in content-based publish-subscribe system[J].Journal of Software,2005,16(2):251-259(in Chinese) [7] Riabov A,Liu Zhen,Wolf J L,et al.Clustering algorithms for content-based publication-subscription systems Proc Int Conf Distrib Comput Syst. Piscataway,NJ:IEEE,2002:133-142 [8] Banavar G, Chandra T, Mukherjee B,et al.Efficient multicast protocol for content-based publish-subscribe systems Proc Int Conf Distrib Comput Syst. Piscataway,NJ:IEEE,1999:262-272 [9] Wang Y M,Qiu L,Achlioptas D,et al.Subscription partitioning and routing in content-based publish/subscribe networks Dahlia M.16th International Symposium on Distributed Computing.Berlin:Springer-Verlag,2002:28-30
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(2793) PDF downloads(910) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return