請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37464
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 雷欽隆 | |
dc.contributor.author | Yu-Cheng Su | en |
dc.contributor.author | 蘇育正 | zh_TW |
dc.date.accessioned | 2021-06-13T15:29:04Z | - |
dc.date.available | 2008-07-21 | |
dc.date.copyright | 2008-07-21 | |
dc.date.issued | 2008 | |
dc.date.submitted | 2008-07-16 | |
dc.identifier.citation | References
1. A. Rowstron and P. Druschel. “Pastry: Scalable, Distributed Object location and Routing for Large-Scale Peer-to-Peer Systems.” In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, pp.329-350, Heidelberg, Germany, November 12-16, 2001. 2. Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph. “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing.” Technical Report No. UCB/CSD-01-1141, University of California Berkeley, April 2001. 3. D. Lewin. “Consistent hashing and random trees: Algorithms for caching in distributed networks.” Master thesis, Department of EECS, MIT, 1998. 4. D. Karger, E. Lehman, F. Leighton, M.levine, D. Lewin and R. Panigraphy. “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on World Wide Web.” In Proc. Of the 29th Annual ACM Symposium on Theory of Computing, May 1997. 5. Dong Xuan, S. Chellappan, and M. Krishnamoorthy. “RChord: an enhanced Chord system resilient to routing attacks.” Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference, pp. 253-260, Oct, 20-23, 2003. 6. E. Adar and B. A. Huberman. “Free riding on gnutella.” Technical report, Xerox PARC, August, 2000. 7. Feng Hong, Minglu Li, Jiadi Yu, and Yi Wang. “PChord: improvement on chord to achieve better routing efficiency by exploiting proximity.” Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference, pp. 806-811, June 6-10, 2005. 36 8. Gnutella. http://gnutella.wego.com/. 9. Hongwei Chen, and Zhiwei Ye. “BChord: Bi-directional routing DHT based on chord.” Computer Supported Cooperative Work in Design, 2008. CSCWD 2008. 12th International Conference, pp.410-415, April 16-18, 2008. 10. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. “Freenet: A Distributed Anonymous Information Storage and Retrieval System.” In Proceedings of the International Workshop on Design Issues in Anonymity and Unobservability, pp.46-66, Berkeley, CA, July 25-26, 2000. 11. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.” In Proceedings of the ACM SIGCOM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp.149-160, San Diego, CA, August 27-31, 2001. 12. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.” Technical report, TR-819, MIT LCS, March 2001. http://www.pdos.lcs.mit.edu/chord/papers 13. Jing Wang, Shoubao Yang, and Leitao Guo. “A Bidirectional Query Chord System Based on Latency-Sensitivity.” Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference, pp. 164-167, Oct, 2006. 14. Jiping Xiong, Youwei Zhang, Peilin Hong, Jinsheng Li. “Chord6: IPv6 Based Topology-Aware Chord.” Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005. ICAS-ICNS 2005. Joint International Conference, pp. 4, Oct 23-28, 2005. 15. Le Hai Dao and JongWon Kim. “AChord: Topology-Aware Chord in 37 Anycast-Enabled Networks.” Hybrid Information Technology, 2006. ICHIT '06. International Conference on Volume 2, pp. 334-341, Nov 9-11, 2006. 16. M. K. Reiter and A. D. Rubin. “Crowds: Anonymity for Web Transactions.” ACM Transactions on Information and System Security (TISSEC), pp.66-92, Volume 1, Number 1, November 1998. 17. P. Mayamounkov and D. Mazieres. “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric.” In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS’02), pp.53-65, Cambridge, MA, March 7-8, 2002. 18. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. “A scalable content-addressable network.” In Proc. SIGCOMM 2001, pp. 161-272. 19. Tor. https://www.torproject.org/ 20. Wang, Biqing and He, Peng. “L-Chord: Routing Model for Chord Based on Layer-Dividing.” Computational Intelligence and Security, 2007 International Conference, pp.262 – 265, Dec 15-19, 2007. 21. Xue Kaiping, Hong Peilin, and Li Jinsheng. “FS-Chord: A New P2P Model with Fractional Steps Joining.” Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference, pp.98, Feb 19-25, 2006. 22. Ye Liu, Peng Yang, Zi Chu, anf Jiagao Wu. “TCS-Chord: An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode.” Semantics, Knowledge and Grid, 2005. SKG '05. First International Conference, pp. 25, Nov, 2005. 23. Yi Jiang and Jinyuan You. “A Low Latency Chord Routing Algorithm for DHT.” Pervasive Computing and Applications, 2006 1st International Symposium, pp. 825 – 830, Aug 3-5, 2006. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37464 | - |
dc.description.abstract | 這篇論文提出了一個應用於結構化同儕網路之區段式路由模型。根據一個預先定義的參數,我們將結構化同儕網路的鍵值空間分割成許多的區段。在每個區段裡最多擁有一個超級節點,而這區段的其他成員都被稱作局部節點。由模擬的結果可看出,提出的這個路由模型不但減少當節點不斷的加入或離開時所需要的維護負擔,而且改善了查詢時的效能。 | zh_TW |
dc.description.abstract | This thesis describes a sector-based routing model over structured peer-to-peer networks. According to a predefined system parameter, we divide the key space of structured peer-to-peer network into several sectors. Each sector contains at most one super node and other members in the sector are called local nodes. The results of Simulation show that the routing model dose not only reduces the overhead of maintenance overhead when nodes frequently join or leave in the structured peer-to-peer network, but also improve the performance for lookup. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T15:29:04Z (GMT). No. of bitstreams: 1 ntu-97-R95944026-1.pdf: 861507 bytes, checksum: f11f810afe0e2c059e64e35a8109fe12 (MD5) Previous issue date: 2008 | en |
dc.description.tableofcontents | Contents
Chapter 1 Introduction ............................................................................................... 1 1.1 Classifications of P2P Networks .................................................................... 1 1.2 Structured P2P Networks ............................................................................... 3 1.3 Thesis Organization ....................................................................................... 4 Chapter 2 Related Work ............................................................................................. 5 2.1 Chord ............................................................................................................ 5 2.2 FS-Chord ....................................................................................................... 8 2.3 L-Chord ....................................................................................................... 10 Chapter 3 System Description .................................................................................. 12 3.1 SB-Chord .................................................................................................... 12 3.2 Lookup ........................................................................................................ 15 3.3 Join.............................................................................................................. 18 3.4 Leave........................................................................................................... 21 3.5 Split and Merge ........................................................................................... 21 Chapter 4 System Analysis....................................................................................... 23 Chapter 5 Simulation ............................................................................................... 26 5.1 Path Length ................................................................................................. 26 5.2 Join Messages .............................................................................................. 27 5.3 Extra Overhead of Super Node .................................................................... 31 Chapter 6 Conclusions ............................................................................................. 33 | |
dc.language.iso | en | |
dc.title | 應用於結構化同儕網路之區段式路由模型 | zh_TW |
dc.title | A Sector-Based routing Model over Structured Peer-to-Peer Networks | en |
dc.type | Thesis | |
dc.date.schoolyear | 96-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 陳英一,劉立,黃秋煌 | |
dc.subject.keyword | 同儕網路,結構化同儕網路, | zh_TW |
dc.subject.keyword | peer-to-peer network,structured peer-to-peer network, | en |
dc.relation.page | 37 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2008-07-17 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊網路與多媒體研究所 | zh_TW |
顯示於系所單位: | 資訊網路與多媒體研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-97-1.pdf 目前未授權公開取用 | 841.32 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。