Distributed Tree Infrastructure for Peer-to-Peer Systems

对等系统的分布式树基础设施

• 批准号: 0305258
• 负责人: James Aspnes
• 金额: $ 30万
• 依托单位: Yale University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-09-01 至 2006-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0305258&HistoricalAwards=false
• 关键词: Distributed; Tree; Infrastructure; Peer; Systems

Peer-to-peer networks are distributed systems without any centralauthority that are used for efficient management and location ofshared resources. Unlike traditional client-server architectures,which concentrate load on a small number of server machines,peer-to-peer systems provide inherent scalability by distributing thecost of maintaining the system across its participants. At the sametime, peer-to-peer systems create new challenges for efficient androbust implementation, as they are built from untrusted and unreliablecomponents and can provide survivability only as an emergent propertyof the system as a whole.The project studies applications of large-scale distributed datastructures to peer-to-peer systems, with an emphasis on efficiency,scalability, fault-tolerance, and recovery. Major goals of theproject include (a) design and implementation of mechanisms foroptimal trade-offs between use of the network and use of localstorage; (b) design and implementation of mechanisms for very fastconstruction of large-scale distributed data structures; and (c) useof data structures providing ``range queries,'' in which the datastructure finds nearest matches to a desired object instead of justexact matches, to support versioning, replication, and approximatematching.

P2P网络是一种没有任何中央权威的分布式系统，用于有效地管理和定位共享资源。 与传统的客户端-服务器架构不同，它将负载集中在少数服务器机器上，对等系统通过在其参与者之间分配维护系统的成本来提供固有的可扩展性。 与此同时，对等系统为高效的androbust实现带来了新的挑战，因为它们是由不可信和不可靠的组件构建的，并且只能作为系统的一个紧急属性提供生存性。 该项目的主要目标包括：（a）设计和实现网络使用和本地存储使用之间的最佳权衡机制;（B）设计和实现大规模分布式数据结构的快速构造机制;以及（c）使用提供"范围查询“的数据结构，其中该数据结构找到与所需对象的最接近匹配，而不是仅找到精确匹配，来支持版本控制、复制和近似匹配。