跳到主要內容

臺灣博碩士論文加值系統

(44.211.26.178) 您好!臺灣時間:2024/06/15 03:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:徐世明
研究生(外文):Shih-Ming Hsu
論文名稱:探討行動隨意網路下分散式雜湊表中的拓樸落差問題
論文名稱(外文):A Study on Topology Mismatch Problem for DHT in MANETs
指導教授:劉傳銘劉傳銘引用關係
口試委員:俞征武王正豪
口試日期:2009-01-20
學位類別:碩士
校院名稱:國立臺北科技大學
系所名稱:資訊工程系研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:中文
論文頁數:52
中文關鍵詞:同儕網路分散式雜湊表拓樸落差問題
外文關鍵詞:P2PDHTTopology Mismatch ProblemMANETRLM
相關次數:
  • 被引用被引用:0
  • 點閱點閱:247
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
同儕網路(Peer-to-peer Networks)為近年來最熱門的研究議題之一,相關服務獲得廣泛地應用。同儕網路依架構特性的考量,一般採取用分散式雜湊表(Distributed Hash Table)的結構化方式建立其應用與服務。然而現存的分散式雜湊表大都未考量底層網路狀況,使得 Underlying Layer與Overlay Layer之間產生拓樸落差問題(Topology Mismatch Problem),使得實際在網路上的運作效能大打折扣。而在動態的網路環境下,拓樸落差問題的影響更趨嚴重。在此篇論文中以分散式雜湊常使用的Chord查詢架構作為探討的基本架構,以跨層(cross-layer)的角度來考量分散式雜湊表的建構與查詢方式,提出Hierarchical Swift RLM(HS-RLM)。HS-RLM利用Random LandMarking(RLM)所提出之動態地標技術建立相依的拓樸且結合MANET路由資訊來改善節點的查詢與資料的維護程序。因此,HS-RLM能夠有效降低拓樸落差問題的影響,提升分散式雜湊表查詢的效能。
In these days, most of the P2P systems use distributed hash table (DHT) on a structured architecture to provide services and applications. Most of the existing approaches using DHT did not consider the practical underlying routing overhead when executing the searching process on the logical overlay layer. The actual performance on latency and energy hence is degenerated. This is what we called the Topology Mismatch Problem. In this paper, we proposed a cross-layer design to minimize the effect of Topology Mismatching Problem in MANET. We integrated DHT with routing information and proposed a novel P2P system for MANET. We last validate our protocols through extensive experiments. In comparison with other algorithms, such as Chord, and RLM, our experimental results show that the proposed approaches outperform the others.
摘 要 i
ABSTRACT ii
誌 謝 iii
目 錄 iv
表目錄 v
圖目錄 vi
第一章 序論 1
1.1 背景 1
1.2 論文結構 8
第二章 相關文獻探討 9
2.1 Chord演算法 9
2.2 拓樸落差相關文獻探討 21
2.2.1 拓樸落差問題相關文獻簡介 21
2.2.2 RLM演算法 27
第三章 探討的議題 30
3.1 拓樸落差問題 30
3.2 本論文所探討的議題 31
第四章 演算法的作法與探討 33
4.1 Hierarchical Swift RLM演算法 33
第五章 實驗討論 41
5.1 實驗環境 41
5.2 實驗結果 42
5.2.1 疊蓋層查詢路徑長 (Overlay Path Length) 42
5.2.2 實體層查詢路徑長(Physical Path Length) 43
5.2.3 延遲時間( Latency ) 44
5.2.4 查詢路徑比(Path Length Ratio) 45
5.2.5 查詢成功率(Success Rate) 47
第六章 結論 49
參考文獻 50
[1]S.A. Baset and H. Schulzrinne. An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. In Proceedings of 25th IEEE International Conference on Computer Communications, 2006.
[2]H. Chiang, H. Chen, and F. Kuo. Locality Support for Mobile P2P network. In Proceedings of the ACM International Conference on Wireless Communications and Mobile Computing, 2007, pages 517-522.
[3]I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: a Distributed Anonymous Information Storage and Retrieval System. In Proceedings of International Workshop on Designing privacy Enhancing Technologies, pages 46-66, 2001
[4]C. Cramer and T. Fuhrmann. Proximity Neighbor Selection for a DHT in Wireless Multi-hop Networks. In Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, 2005.
[5]R. Ferreira, S. Jagannathan, and A. Grama. Locality in Structured Peer-to-Peer Networks. Journal of Parallel and Distributed Computing, 66(2):257-273, 2006.
[6]T. Heer, S. Gotz, S. Rieche, and K. Wehrle. Adapting Distributed Hash Tables for Mobile Ad Hoc Networks. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications, 2006.
[7]F. Hong, M. Li, J. Yu, and Y. Wang. PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity. IEICE Transactions on Information and Systems, E89-D (2):546-554, 2006.
[8]Y. Jiang and J. You. A Low Latency Chord Routing Algorithm for DHT. In Proceedings of the 1st International Symposium on Pervasive Computing and Applications, 2006, pages 17-32.
[9]Y. Joung and J. Wang. Chord2: A Two-layer Chord for Reducing Maintenance Overhead Via Heterogeneity. Computer Networks, 51(3):712-731, February 2007.
[10]P. Karwaczyński and J. Močnik. IP-based Clustering for Peer-to-Peer Overlays. Journal of Software, 2(2):30-37, 2007.
[11]P. Karwaczyński and J. Močnik. Self-Optimization of a DHT-Based Discovery Service. In Proceedings of the IEEE International Conference on Computing in the Global Information Technology, 2007.
[12]B. Leong, B. Liskov, and E. Demaine. EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Computer Communications, 29(9): 1243-1259, May 2006.
[13]H. Le and J. Kim. AChord: Topology-Aware Chord in Anycast-Enabled Networks. In Proceedings of the IEEE International Conference on Hybrid Information Technology, 2006.
[14]Y. Liu and P. Yang, L. Chu, and J. Wu. TCS-Chord: An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode. In Proceedings of the First International Conference on Semantics, Knowledge and Grid. 2005.
[15]Y. Liu, Z. Zhuang, L. Xiao, and L. M. Ni. A Distributed Approach to Solving Overlay Mismatching Problem. In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 132-139,2004.
[16]Y. Liu, Z. Zhuang, L. Xiao, and L. M. Ni. AOTO: Adaptive Overlay Topology Optimization in Unstructured P2P systems. In Proceedings of the IEEE International Conference on Global Telecommunications, 7:4186- 4190, 2003.
[17]P. Maymounkov and D. Mazi`eres. Kademlia: A Peer-to-Peer information system Based on the Xor Metric. In Proceedings of the First International Workshop on Peer-to-Peer Systems, pages 53-65, 2002.
[18]S. Morimoto and F. Teraoka. CHOP6: A DHT Routing Mechanism Considering Proximity. In Proceedings of the International Workshops on Internet, pages 59-62, 2007.
[19]H. Pucha, S. Das, and Y. Hu. Ekta: an Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks. In Proceedings of the IEEE International Workshop on Mobile Computing Systems and Applications, pages 163-173, 2004.
[20]S. Ratnasamy, P. Francis, M. Handley, Richard Karp, and S. Shenker. A Scalable Content-Addressable Network. ACM Journal on Applications technologies architectures and protocols for computer communications, 31(4):161-172, 2001.
[21]M. Ripeanu, A. Iamnitchi, and I. Foster. Mapping the gnutella network. IEEE Internet Computing,6(1):50-57, 2002.
[22]I. Stoica, H. Balakrishnan, R. Morris, D. Karger, and M. Kaashoek. Chord:A scalable Peer-to-Peer Lookup Service for Internet Applications. In Proceedings of the IEEE International Conference on Networking, 2001, pages 17-32.
[23]S. Ren, L. Guo, S. Jiang, and X. Zhang. SAT-Match. A Self-Adaptive Topology Matching method to AchieveLow Lookup Latency in Structured P2P Overlay Networks. In Proceedings of the 18th International Parallel and Distributed Processing Symposium, 2004.
[24]A. I. T. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms. pages 325-359.
[25]P. Ski, D. Konieczny, J. Mo, and M. Novak. Dual Proximity Neighbour Selection Method for Peer-to-peer-based Discovery Service. In Proceedings of the ACM symposium on Applied computing, 2007.
[26]H. Tanta-ngai and M. McAllister. A peer-to-peer expressway over Chord. Mathematical and Computer Modelling, 44( 7-8): 659-677, 2006.
[27]H. Wang and Y. Lin. Cone: A Topology-Aware Structured P2P System with Proximity Neighbor Selection. Journal of Future generation communication and networking. Vol. 1, pages 43-49, 2007.
[28]R. Winter, T. Zahn, and J. Schiller. Random Landmarking in Mobile Topology-Aware Peer-to-Peer Networks. In Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004.
[29]Z. Xu, X. He, and L. Bhuyan. Efficient File Sharing Strategy in DHT Based P2P Systems. In Proceedings of the IEEE International Conference on Performance, Computing and Communications, pages 151-158, 2005.
[30]J. Xiong, Y. Zhang, P. Hong, and J. Li. Chord6: IPv6 Based Topology-Aware Chord. In Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, 2005.
[31]Y. Yu, Y. Miao, and C. Shieh. Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters. In Proceeding of the 14th IEEE International Conference on Networks, 2006.
[32]S. Zoels, Z. Despotovic, and W. Kellerer. On hierarchical DHT systems – An analytical approach for optimal designs. Computer Communications, 31(3):576-590, 2008.
[33]H. Zhang, A. Goel, and R. Govindan. Incrementally Improving Lookup Latency in Distributed Hash Table Systems Using Random Sampling. IEEE or ACM Transactions on Networking, 13(5):1121-1134, 2005.
[34]B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz. Tapestry: A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53, 2004.
[35]Uncovering Opportunities in P2P Where We Are Now and Where We’re Headed, http://www.nii.org.tw/cnt/info/Report/20020901_1.htm. (viewed available 2008/10/26 )
[36]Napster, http://www.napster.com/.(viewed available 2008/7/12)
[37]PPstream ,http://www.ppstream.com/ .(viewed available 2008/10/12)
[38]SETI@Home,http://setiathome.berkeley.edu/.(viewed available 2008/11/15)
[39]TWNIC,http://www.twnic.net.tw/survy.xls. (viewed available 2008/11/18)
[40]Kazaa, http://www.kazaa.com/ . (viewed available 2008/12/7)
[41]Jxta,https://jxta.dev.java.net/.(viewed available 2008/6/24)
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊