Structured Peer-to-Peer Systems: Fundamentals of Hierarchical Organization, Routing, Scaling, and Security
暫譯: 結構化對等系統:分層組織、路由、擴展性與安全性的基本原則
Dmitry Korzun
相關主題
商品描述
The field of structured P2P systems has seen fast growth upon the introduction of Distributed Hash Tables (DHTs) in the early 2000s. The first proposals, including Chord, Pastry, Tapestry, were gradually improved to cope with scalability, locality and security issues. By utilizing the processing and bandwidth resources of end users, the P2P approach enables high performance of data distribution which is hard to achieve with traditional client-server architectures. The P2P computing community is also being actively utilized for software updates to the Internet, P2PSIP VoIP, video-on-demand, and distributed backups. The recent introduction of the identifier-locator split proposal for future Internet architectures poses another important application for DHTs, namely mapping between host permanent identity and changing IP address. The growing complexity and scale of modern P2P systems requires the introduction of hierarchy and intelligence in routing of requests.
Structured Peer-to-Peer Systems covers fundamental issues in organization, optimization, and tradeoffs of present large-scale structured P2P systems, as well as, provides principles, analytical models, and simulation methods applicable in designing future systems. Part I presents the state-of-the-art of structured P2P systems, popular DHT topologies and protocols, and the design challenges for efficient P2P network topology organization, routing, scalability, and security. Part II shows that local strategies with limited knowledge per peer provide the highest scalability level subject to reasonable performance and security constraints. Although the strategies are local, their efficiency is due to elements of hierarchical organization, which appear in many DHT designs that traditionally are considered as flat ones. Part III describes methods to gradually enhance the local view limit when a peer is capable to operate with larger knowledge, still partial, about the entire system. These methods were formed in the evolution of hierarchical organization from flat DHT networks to hierarchical DHT architectures, look-ahead routing, and topology-aware ranking. Part IV highlights some known P2P-based experimental systems and commercial applications in the modern Internet. The discussion clarifies the importance of P2P technology for building present and future Internet systems.
商品描述(中文翻譯)
結構化的 P2P 系統自 2000 年代初期引入分散式雜湊表 (DHTs) 以來,已經快速成長。最初的提案,包括 Chord、Pastry 和 Tapestry,逐漸改進以應對可擴展性、區域性和安全性問題。透過利用終端用戶的處理和帶寬資源,P2P 方法實現了數據分發的高效能,這是傳統的客戶端-伺服器架構難以達成的。P2P 計算社群也被積極應用於互聯網的軟體更新、P2PSIP VoIP、隨選視訊和分散式備份。最近提出的識別符-定位符分離提案為未來的互聯網架構帶來了另一個重要的 DHT 應用,即在主機的永久身份和變更的 IP 地址之間進行映射。現代 P2P 系統日益增長的複雜性和規模要求在請求路由中引入層次結構和智能。
《結構化對等網路系統》涵蓋了當前大型結構化 P2P 系統的組織、優化和權衡的基本問題,並提供了適用於設計未來系統的原則、分析模型和模擬方法。第一部分介紹了結構化 P2P 系統的最新技術、流行的 DHT 拓撲和協議,以及高效 P2P 網路拓撲組織、路由、可擴展性和安全性的設計挑戰。第二部分顯示,具有有限知識的本地策略能在合理的性能和安全約束下提供最高的可擴展性水平。儘管這些策略是本地的,但其效率源於層次組織的元素,這在許多傳統上被視為平坦的 DHT 設計中出現。第三部分描述了當一個對等節點能夠以更大的知識(仍然是部分的)運作時,逐步增強本地視圖限制的方法。這些方法是在從平坦 DHT 網路演變到層次 DHT 架構、預測路由和拓撲感知排名的層次組織演變中形成的。第四部分突顯了一些已知的基於 P2P 的實驗系統和現代互聯網中的商業應用。討論澄清了 P2P 技術在構建當前和未來互聯網系統中的重要性。