Pastry Scalable, decentralized object location and routing糕点的可扩展性分散的对象的位置和路由.pptVIP

下载本文档

1
0
约3.86千字
约 19页
2017-03-08 发布于上海
举报
版权申诉

Pastry Scalable, decentralized object location and routing糕点的可扩展性分散的对象的位置和路由.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Pastry Scalable, decentralized object location and routing糕点的可扩展性分散的对象的位置和路由

Sep 8, 2003 CS 294-4: Peer-to-Peer Systems Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems(Antony Rowstron and Peter Druschel) Shariq Rizvi First Year Graduate Student CS Division, UC Berkeley rizvi@cs.berkeley.edu Pastry An overlay network that provides a self-organizing routing and location service (like Chord) Seeks to minimize the distance (scalar proximity metric like routing hops) messages travel Expected number of routing steps is O(log N); N=No. of Pastry nodes in the network Outline Guarantees Design of pastry Node state Routing algorithm Self-organization Addressing locality Experimental Results Discussion Guarantees NodeId randomly assigned from {0, .., 2128-1} b, |L| are configuration parameters Under normal conditions: A pastry node can route to the numerically closest node to a given key in less than log2b N steps Despite concurrent node failures, delivery is guaranteed unless more than |L|/2 nodes with adjacent NodeIds fail simultaneously Each node join triggers O(log2b N) messages Pastry Node State (1) Routing Table NodeIds are in base 2b Several rows – one for each prefix of local NodeId (Log2b N populated on average) 2b – 1 columns – one for each possible digit in the NodeId representation b defines the tradeoff: (Log2b N) x (2b – 1) entries Vs. Log2b N routing hops Routing Messages Routing Performance: Intuition (1) – Single hop, termination (2) – No. of nodes which prefix-match the key upto current length reduces by 2b (3) – Low probability, adds one hop The Pastry API Operations exported by Pastry nodeId = pastryInit(Credentials,Application) route(msg,key) Operations exported by the application working above Pastry deliver(msg,key) forward(msg,key,nextId) newLeafs(leafSet) Self-organization: Node Arrival Arriving Node X knows “nearby” node A X asks A to route a “join” message with key = NodeId(X) Message targets Z, whose NodeId is numerically closest to NodeId(X) All nodes along the