• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFIP/ACM International Conference on Distributed Systems Platforms Nov 12-16, 2001, Heidelberg, Germany >Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
【24h】

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

机译：Pastry：大规模对等系统的可扩展，分散式对象定位和路由

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeld that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeld space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
机译：本文介绍了Pastry的设计和评估，它是一种可扩展的，分布式对象定位和路由基板，适用于广域对等应用。 Pastry在可能非常大的通过Internet连接的节点的覆盖网络中执行应用程序级路由和对象定位。它可以用于支持各种对等应用程序，包括全局数据存储，数据共享，组通信和命名。 Pastry网络中的每个节点都有一个唯一的标识符（nodeId）。当出现消息和密钥时，Pastry节点在所有当前活动的Pastry节点中，将消息有效地路由到数值上最接近密钥的nodeId的节点。每个Pastry节点都跟踪其在nodeId空间中的直接邻居，并向应用程序通知新节点的到来，节点故障和恢复。糕点考虑了网络位置；它根据IP路由跃点数之类的标量接近度度量，试图使消息传播的距离最小化。糕点是完全去中心化，可扩展和自组织的；它会自动适应节点的到达，离开和故障。在多达100,000个节点的仿真网络上使用原型实现获得的实验结果证实了Pastry的可扩展性和效率，自组织能力和对节点故障的适应能力以及良好的网络局部性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号