A Sector-Based routing Model over Structured Peer-to-Peer Networks

這篇論文提出了一個應用於結構化同儕網路之區段式路由模型。根據一個預先定義的參數，我們將結構化同儕網路的鍵值空間分割成許多的區段。在每個區段裡最多擁有一個超級節點，而這區段的其他成員都被稱作局部節點。由模擬的結果可看出，提出的這個路由模型不但減少當節點不斷的加入或離開時所需要的維護負擔，而且改善了查詢時的效能。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.Contentshapter 1 Introduction ............................................................................................... 1.1 Classifications of P2P Networks .................................................................... 1.2 Structured P2P Networks ............................................................................... 3.3 Thesis Organization ....................................................................................... 4hapter 2 Related Work ............................................................................................. 5.1 Chord ............................................................................................................ 5.2 FS-Chord ....................................................................................................... 8.3 L-Chord ....................................................................................................... 10hapter 3 System Description .................................................................................. 12.1 SB-Chord .................................................................................................... 12.2 Lookup ........................................................................................................ 15.3 Join.............................................................................................................. 18.4 Leave........................................................................................................... 21.5 Split and Merge ........................................................................................... 21hapter 4 System Analysis....................................................................................... 23hapter 5 Simulation ............................................................................................... 26.1 Path Length ................................................................................................. 26.2 Join Messages .............................................................................................. 27.3 Extra Overhead of Super Node .................................................................... 31hapter 6 Conclusions ............................................................................................. 3