跳到主要內容

臺灣博碩士論文加值系統

(44.213.60.33) 您好!臺灣時間:2024/07/21 13:42
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:簡士強
研究生(外文):Shih-Chiang Chien
論文名稱:點對點環境下的通用發佈/訂閱框架
論文名稱(外文):A Generic Publish/Subscribe Framework for Peer-to-Peer Environment
指導教授:袁賢銘袁賢銘引用關係
指導教授(外文):Shyan-Ming Yuan
學位類別:碩士
校院名稱:國立交通大學
系所名稱:資訊科學與工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:66
中文關鍵詞:點對點網路發佈訂閱系統開發平台
外文關鍵詞:Peer-to-PeerPub/Sub SystemDevelopment Framework
相關次數:
  • 被引用被引用:0
  • 點閱點閱:206
  • 評分評分:
  • 下載下載:13
  • 收藏至我的研究室書目清單書目收藏:0
直至今日,許多新的點對點網路演算法仍不斷的被提出。應用程式開發者便需要學習各種相異API的用法,因而增加了開發者在轉換使用不同點對點網路時額外的負擔。同時也使得開發者難以針對特定應用領域評量各點對點網路的優劣。而從點對點網路開發者的角度來看,如果能夠提供一組完備且可重用的網路傳輸組件,將能大幅的提昇開發者將點對點網路部署到各種實體網路的進程。
本研究提出一個全新的開發框架,協助開發者使用各種點對點網路拓墣與發佈訂閱演算法來開發點對點網路應用程式。在我們所提出的系統架構中,包含了各個開發點對點網路相關應用所需的功能,其中涵蓋了「網路傳輸」、「點對點網路演算法」、「網路啟動」與「可抽換發布訂閱服務」四項功能群。為了展示此開發框架的通用性與優點,我們提供了環狀網路與Viceroy點對點網路的示範實作,並且提供一個簡單的發布訂閱演算法實作。此外,我們將透過一個範例應用程式來展現此框架在開發點對點發布訂閱應用時,藉由抽換功能組件達成部署應用於不同環境上的便利性。
At present, the structured P2P algorithms have been proposed frequently. Consequently, the P2P application developers need to learn different API semantics. It generates additional efforts of switching to different P2P topologies. Moreover, it is difficult for the developers to evaluate the performance of an application based on a particular underneath P2P APIs. On the other hand, if the P2P framework can provide reusable and comprehensive network communication components, it can expedite developing progress. Therefore, the P2P protocols can easily accommodate to different network environments.
In this research, a novel P2P developing framework is proposed to assist in developing P2P applications by using various structured P2P protocols and P2P pub/sub algorithms. We design an architecture to construct the structured P2P functional blocks, including network communication components, P2P topology maintenance and routing, network bootstrapping, as well as pluggable pub/sub services. In order to demonstrate the genuineness and generality of the framework, we provide a ring protocol, the Viceroy DHT implementation, and a simple pub/sub algorithm. Furthermore, we generate a client application to indicate the convenience of exchanging among different underlying networks, P2P protocols, and pub/sub services.
ACKNOWLEDGEMENT I
TABLE OF CONTENTS II
LIST OF FIGURES V
LIST OF TABLES VI
1. INTRODUCTION 1
1.1. MOTIVATION 2
1.2. CONTRIBUTIONS OF THIS THESIS 4
1.3. THESIS OUTLINE 4
2. BACKGROUND AND RELATED WORK 5
2.1. BACKGROUND 5
2.1.1. Structured P2P Network 5
2.1.2. P2P Publish/Subscribe Algorithm 7
2.2. P2P COMMON API 8
2.3. PUBLISH/SUBSCRIBE COMMON API 9
2.4. P2P PUB/SUB LIBRARY 10
3. SYSTEM ARCHITECTURE 11
3.1. OVERVIEW 11
3.2. P2P PROTOCOL LAYER 12
3.2.1. Peer interface 14
3.2.2. PeerFactory class 15
3.2.3. Resource, Id, and PeerId interface 15
3.2.4. IdFactory and PeerIdFactory interface 16
3.2.5. CancellableTask interface 16
3.2.6. Service interface 16
3.3. PUB/SUB SERVICE AND API 16
3.3.1. PubSubService interface 17
3.3.2. Publisher and Subscriber 18
3.3.3. EventHandler interface 19
3.3.4. Event interface 19
3.4. TRANSPORT LAYER 20
3.4.1. CommunicationManager interface 21
3.4.2. Address interface 21
3.4.3. RouteMessage interface 21
3.4.4. Message interface 21
3.5. BOOTSTRAP SERVICE 22
3.5.1. BootstrapService interface 22
4. IMPLEMENTATION DETAILS 23
4.1. CONTROL FLOW 23
4.1.1. Peer Bootstrapping 23
4.1.2. Message Transmission 24
4.1.3. Pub/Sub Actions 26
4.2. ADDITIONAL CLASS USAGE 27
4.2.1. Environment 27
4.2.2. AbstractPeer 28
4.2.3. AbstractEvent 28
4.2.4. NodeHandle 28
4.2.5. Topic 29
4.2.6. LocalBootstrapService 29
4.2.7. HttpBootstrapService 29
4.2.8. LocalCommunicationManager 30
4.2.9. TCPCommunicationManager 30
5. EVALUATIONS 31
5.1. SCENARIO DEMONSTRATION 31
5.1.1. Implementing P2P Protocol 31
5.1.2. Implementing Pub/Sub Service 36
5.1.3. Develop P2P Pub/Sub Application 38
5.2. COMPARISONS 43
6. CONCLUSION AND FUTURE WORK 46
6.1. CONCLUSION 46
6.2. FUTURE WORK 47
7. APPENDIX 50
A. THE RING PROTOCOL 50
B. ENHANCED VICEROY PROTOCOL 52
C. THE SIMPLE PUB/SUB PROTOCOL 57
D. EXAMPLE PROGRAM 58
I. Publish Client 58
II. Subscribe Client 60
8. REFERENCES 63
[1] K. Aberer, L. O. Alima, A. Ghodsi, S. Girdzijauskas, S. Haridi and M. Hauswirth, "The Essence of P2P: A Reference Architecture for Overlay Networks," P2P, vol. 0, pp. 11-20, 2005.
[2] J. Aspnes and G. Shah, "Skip graphs," ACM Trans. Algorithms, vol. 3, pp. 37, 2007.
[3] M. Bender, S. Michel, S. Parkitny and G. Weikum, "A Comparative Study of Pub/Sub Methods in Structured P2P Networks," Databases, Information Systems, and Peer-to-Peer Computing, pp. 385-396, 2007.
[4] M. Castro, P. Druschel, A. -M. Kermarrec and A. I. T. Rowstron, "Scribe: a large-scale and decentralized application-level multicast infrastructure," Selected Areas in Communications, IEEE Journal on, vol. 20, pp. 1489-1499, 2002.
[5] G. Ciaccio, "A Pretty Flexible API for Generic Peer-to-Peer Programming," Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International, pp. 1-8, 26-30 March 2007.
[6] F. Dabek, M. F. Kaashoek, D. Karger, R. Morris and I. Stoica, "Wide-area cooperative storage with CFS," SIGOPS Oper. Syst. Rev., vol. 35, pp. 202-215, 2001.
[7] F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz and I. Stoica, "Towards a Common API for Structured Peer-to-Peer Overlays," Peer-to-Peer Systems II, pp. 33-44, 2003.
[8] F. Delmastro, M. Conti and E. Gregori, "P2P common API for structured overlay networks: A cross-layer extension," in WOWMOM '06: Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks, 2006, pp. 593-597.
[9] P. Fraigniaud and P. Gauron, "D2B: A de Bruijn based content-addressable network," Theoretical Computer Science, vol. 355, pp. 65-79, 4/6. 2006.
[10] D. Haussheer, "Decentralized auction-based pricing with PeerMart," Integrated Network Management, 2005. IM 2005. 2005 9th IFIP/IEEE International Symposium on, pp. 381-394, 2005.
[11] M. O. Junginger, "A self-organizing publish/subscribe middleware for dynamic peer-to-peer networks," Network, IEEE, vol. 18, pp. 38-43, 2004.
[12] M. Kaashoek and D. Karger, "Koorde: A Simple Degree-Optimal Distributed Hash Table," Peer-to-Peer Systems II, pp. 98-107, 2003.
[13] Y. Kulbak and D. Bickson, "The emule protocol specification," 2005.
[14] A. Loo, “The future of peer-to-peer computing,” Communications of the ACM, vol. 46, issue 9, pp. 57, 2003.
[15] E. K. Lua, J. Crowcroft, M. Pias, R. Sharma and S. Lim, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," Communications Surveys & Tutorials, IEEE, vol. 7, pp. 72-93, 2005.
[16] D. Malkhi, M. Naor and D. Ratajczak, "Viceroy: a scalable and dynamic emulation of the butterfly," pp. 183-192, 2002.
[17] P. Manish, J. Nanyan, S. Cristina and M. Vincent. (2007, Feb. 21). Meteor. 2.4.1
Available: https://jxta-meteor.dev.java.net/
[18] J. M�黔k, M. Alberto, P. Gian Jesi and V. Spyros. (2007, Dec. 23). PeerSim: A peer-to-peer simulator. 1.0.3
Available: http://peersim.sourceforge.net/
[19] P. Maymounkov and D. Mazieres, "Kademlia: A Peer-to-peer Information System Based on the XOR Metric," 2002.
[20] MONKIA Info., "NUWeb," 2007
Available: http://tw.nuweb.cc/
[21] OSGi Alliance, "OSGi Service Platform Core Specification Release 4.1," October. 2007.
[22] D. Peter, E. Eric, G. Romer, H. Andreas, H. Jeff, C. Y. Hu, I. Sitaram, L. Andrew, M. Alan, N. Animesh, P. Ansley, R. Charlie, S. Dan, S. Jim, S. Atul and Z. RongMei. (2007, Nov. 2). FreePastry. 2.0_03
Available: http://freepastry.rice.edu/FreePastry/
[23] P. Pietzuch, D. Eyers, S. Kounev and B. Shand, "Towards a common API for Publish/Subscribe," in DEBS '07: Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, 2007, pp. 152-157.
[24] C. G. Plaxton, R. Rajaraman and A. W. Richa, "Accessing Nearby Copies of Replicated Objects in a Distributed Environment," Theory of Computing Systems, vol. 32, pp. 241-280, 02/24. 1999.
[25] J. Pouwelse, P. Garbacki, D. Epema and H. Sips, "The Bittorrent P2P File-Sharing System: Measurements and Analysis," Peer-to-Peer Systems IV, pp. 205-216, 2005.
[26] W. Pugh, "Skip lists: a probabilistic alternative to balanced trees," Commun ACM, vol. 33, pp. 668-676, 1990.
[27] S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Schenker, "A scalable content-addressable network," in SIGCOMM '01: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp. 161-172.
[28] J. Risson and T. Moors, "Survey of Research Towards Robust Peer-to-Peer Networks: Search Methods," Computer Networks, vol. 50, pp. 3485-3521, 12/5. 2006.
[29] B. Roberto, Q. Leonardo and V. Antonino, “Distributed event routing in Publish/Subscribe communication systems: A survey,” In: Technical Report TR-1/06, rnDipartimento di Informatica e Sistemistica, nUniversit�� di Roma ‘La Sapienza’ (2005).
[30] R. Rodrigues, B. Liskov and L. Shrira, "The design of a robust peer-to-peer system," in EW10: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, 2002, pp. 117-124.
[31] A. I. T. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," in Middleware '01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, 2001, pp. 329-350.
[32] I. Stoica, D. Adkins, S. Zhuang, S. Shenker and S. Surana, "Internet indirection infrastructure," in SIGCOMM '02: Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2002, pp. 73-86.
[33] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," SIGCOMM Comput. Commun. Rev., vol. 31, pp. 149-160, 2001.
[34] Sun Microsystems Inc. (2007, Oct 16th). JXTA v2.0 protocols specification.
Available: https://jxta-spec.dev.java.net/nonav/JXTAProtocols.html
[35] Sun Microsystems Inc. (2003, Dec 2nd). Java message service API.
Available: http://www.jcp.org/en/jsr/detail?id=914
[36] B. Zhao, J. Kubiatowicz and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Computer Science Division, U. C. Berkeley, apr, 2001.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top