簡易檢索 / 詳目顯示

研究生: 蔡佳良
Jia-Liang Tsai
論文名稱: 在P2P網路上的發佈/訂閱系統之研究
Fleet: A System for Publish/Subscribe Service over P2P Networks
指導教授: 陳秋華
Chyou-Hwa Chen
口試委員: 邱舉明
none
鄧惟中
none
戴碧如
none
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2009
畢業學年度: 97
語文別: 英文
論文頁數: 40
中文關鍵詞: 發佈/訂閱系統P2P網路
外文關鍵詞: event, distributed hash table, rendezvous-based mapping
相關次數: 點閱:260下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 我們介紹一種以P2P 網路為基礎的主題式發佈/訂閱系統,如何能更有效的利用網路的資源,分散負載於更多的節點上,有效的利用分散式網路。
    透過分析Attribute的出現機率,將之分類為熱門(Hot)與非熱門(Cold)兩大類,然後再針對各種情況,我們提出幾種有效的策略來分散負載於更多的節點上。
    我們提出的方法可以在變動event數量、subscription數量、attribute數量、與網路大小的情況下表現出高適應度。而且我們也與許多不同的發佈/訂閱系統做比較來證明這些結果。


    We propose a new content-based publish/subscribe system, called Fleet, that decouples subscription storage and event delivery mechanisms and seamlessly combines a novel subscription mapping scheme and an address space partitioning technique to derive an effective publish/subscribe system over a distributed hash table (DHT) overlay. To combat skewed attribute distributions in subscriptions and events, we propose a number of novel strategies that exploit of the popularity of attributes to spread the load across a multitude of peers. Fleet strikes an ideal balance between subscription storage cost and event delivery cost, and is shown to be scalable in the number of events, subscriptions, schema attributes, and network peers. Using an extensive set of experiments, Fleet is compared to other state of the art systems and is shown to be superior.

    摘要I ABSTRACTII 誌謝III TABLE OF CONTENTSIV LIST OF FIGURESVI LIST OF TABLESVII 1INTRODUCTION1 1.1MOTIVATION1 2RELATED WORKS5 3FLEET SYSTEM DESIGN9 3.1FLEET ARCHITECTURE10 3.2STRATEGIES FOR SKEWED NAME DISTRIBUTION HANDLING11 3.3ALGORITHMS FOR SUBSCRIPTION INSTALLATION, EVENT PUBLISHING, EVENT MATCHING AND DELIVERY15 3.3.1 SUBSCRIPTION INSTALLATION15 3.3.2 EVENT PUBLISHING22 3.3.3 EVENT MATCHING23 3.3.4 EVENT DELIVERY24 4SIMULATION RESULTS26 4.1 TOTAL SUBSCRIPTION STORAGE COST AND TOTAL EVENT MATCHING COST28 4.2 CUMULATIVE FRACTION OF SUBSCRIPTION STORAGE COST AND EVENT MATCHING COST30 4.3 Event delivery cost32 4.4 Effect of Attribute Name Skew34 4.5 Scalability Properties34 5CONCLUSIONS AND FUTURE WORK CONCLUSION38 REFERENCES39

    [1]M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, Tushar D. Chandra, “Matching events in a content-based subscription system,” in Proceedings of ACM symposium on Principles of distributed computing, 1999
    [2]R Baldoni, C Marchetti, A Virgillito, R Vitenberg, “Content-Based Publish-Subscribe over Structured Overlay Networks, ” in Proceedings of IEEE ICDCS, 2005
    [3]Stefano Castelli, Paolo Costa, Gian Pietro Picco, “Large-Scale Content-Based Routing in a Multidimensional Space,” in Proceedings of IEEE INFOCOM, 2008
    [4]M. Cai, M. Frank, J. Chen P. Szekely. “MAAN: A Mulit-Attribute Addressable Network for Grid Information Services,” Journal of Grid Computing , 2(1), 2004, pp. 3-14
    [5]Li, D. Cao, J. Lu, X. Chen, K., “Efficient Range Query Processing in Peer-to-Peer Systems,” IEEE Transactions on Knowledge and Data Engineering, 2009
    [6] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf. “Design and Evaluation of a Wide-Area Event Notification Service,” ACM Transactions on Computer Systems, 19(3):332–383, 2001
    [7]A. Carzaniga, M.J. Rutherford, and A.L. Wolf, “A Routing Scheme for Content-Based Networking,” in Proceedings of IEEE INFOCOM 2004
    [8]A. Carzaniga and A.L. Wolf, “Forwarding in a Content-Based Network,” in Proceedings of ACM SIGCOMM 2003
    [9]A. Carzaniga and A.L. Wolf, “A Benchmark Suite for Distributed Publish/Subscribe Systems,” Technical Report CU-CS-927-02, Department of Computer Science, University of Colorado, April, 2002.
    [10]Franoise Fabret, Arno Jacobsen, Franois Llirbat, Joo Pereira, Ken Ross, Dennis Shasha, “Filtering algorithms and implementation for very fast publish/subscribe systems,” ACM SIGMOD Record, Volume 30 , Issue 2 (June 2001)
    [11]Jun Gao and Peter Steenkiste, “An Adaptive Protocol for Efficient Support of Range Queries in DHT-based Systems,” in Proceedings of IEEE International Conference on Network Protocols, 2004
    [12]Abhishek Gupta , Ozgur D. Sahin, Divyakant Agrawal, and Amr El Abbadi, “Meghdoot: content-based publish/subscribe over P2P networks,” in Proceedings of the ACM/IFIP/USENIX international conference on Middleware, 2004
    [13]Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, March 2006. ISBN 1-55860-901-6
    [14]Jonathan Ledlie and Margo Seltzer, “Distributed, Secure Load Balancing with Skew, heterogeneity, and Churn,” in Proceedings of IEEE INFOCOM, 2005
    [15]D.S. Li, X.C. Lu, and J. Wu, “FissionE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs,” in Proceedings of IEEE INFOCOM, 2005
    [16]S.C. Lo and Y. T. Chiu, “Design of Content-Based Publish/Subscribe Systems over Structured Overlay Networks,” IEICE Trans. on Information and Systems, vol. E91-D, no.5, pp. 1504-1511, May 2008
    [17]Venugopalan Ramasubramanian and Emin Gun Sirer. “Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays,” In Proceedings of Networked System Design and Implementation (NSDI), 2004.
    [18]Kun-Lung Wu , Philip S. Yu, “Efficient query monitoring using adaptive multiple key hashing,” in Proceedings of the eleventh international conference on Information and knowledge management, 2002
    [19]Xiaoyu Yang and Yiming Hu, “A DHT-based Infrastructure for Content-based Publish/Subscribe Services,” in Proceedings of IEEE International Conference on Peer-to-Peer Computing, 2007
    [20]Yingwu Zhu and Yiming Hu, “Ferry: A P2P-Based Architecture for Content-Based Publish/Subscribe Services,” IEEE Transactions on Parallel and Distributed System, 18 (5), 2007
    [21]http://www.the-gdf.org
    [22]Weixiong Rao , Lei Chen , Ada Wai-Chee Fu , YingYi Bu, “Optimal proactive caching in peer-to-peer network: analysis and application,” in Proceedings of ACM conference on Conference on information and knowledge management, 2007

    無法下載圖示 全文公開日期 2014/07/29 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE