Return-Path: william@bourbon.usc.edu Delivery-Date: Wed Dec 10 17:59:08 2008 X-Spam-Checker-Version: SpamAssassin 3.2.3 (2007-08-08) on merlot.usc.edu X-Spam-Level: X-Spam-Status: No, score=-2.4 required=5.0 tests=AWL,BAYES_00 autolearn=ham version=3.2.3 Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75]) by merlot.usc.edu (8.14.1/8.14.1) with ESMTP id mBB1x8B9017695 for ; Wed, 10 Dec 2008 17:59:08 -0800 Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1]) by bourbon.usc.edu (8.14.2/8.14.1) with ESMTP id mBB21RJk024189 for ; Wed, 10 Dec 2008 18:01:27 -0800 Message-Id: <200812110201.mBB21RJk024189@bourbon.usc.edu> To: cs551@merlot.usc.edu Subject: Re: lecture 22 slide 1 Date: Wed, 10 Dec 2008 18:01:27 -0800 From: Bill Cheng Someone wrote: > in lect. 22 slide 1, how come successor(1)=1, shouldn't it be > successor(1)=3 ? Normally, content hash of a file does not collide with the content hash of a node's address. This is the unusual case. So, if the content hash of a file collides with the content hash of a node's address, then successor(k) is k where k is the content hash. You can also look at slide 5 of lecture 22. Successor(k) is what the successor pointer of k's predecessor points to. -- Bill Cheng // bill.cheng@usc.edu