P-Grid:一种高效的自组织P2P系统  

P-Grid:Efficient self-organizing P2P system

作　　者：张洪军[1] 

机构地区：[1]山东师范大学信息科学与工程学院,山东济南250014

出　　处：《计算机工程与设计》2006年第24期4767-4769,共3页Computer Engineering and Design

摘　　要：P2P(peertopeer)技术在分布计算时代发挥着越来越重要的作用,但在数据管理方面,P2P的应用表现出较大的局限性。作为一种快速高效的P2P信息系统P-Grid,它能够极大地减少其它P2P系统所需要的网络带宽。P-Grid系统的构造和维护严格依照本地交互的随机算法,即使在不可靠的节点也能提供可靠的访问,并且能够较好地衡量存取和通信代价。In recent years, peer-to-peer systems are driving a major paradigm shift in the era of genuinely distributed computing. But it shows up also some of the limitations of current P2P information systems with respect to their ability to manage data efficiently. P-Grid, a scalable access structure that is specially designed for peer-to-peer information systems is introdnced. P-Grids are constructed and maintained by using randomized algorithms strictly based on local interactions, reliable data access is provided even with unreliable peers, and scale gracefully both in storage and communication cost.

关 键 词：P2P P-GRID 节点 搜索 模型 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]