[chord] Question on Chord: A Scalable Peer-to-peer.....

[Ion Stoica]

The keys in Figure 3(b) are arbitrarily chosen. In practice,
the key (id) of a data item can be computed as a hash (e.g., SHA-1)
on the data itself, or it can be any unique key assigned by
applications/users.

Ion


진명희 wrote:

>
> Thank you for your answer~
>
> I have one more question.
> The question is in Figure 3 (b) on page 5 of the paper Chord.
> I understood every thing about routing table but the key values..
> I don't know how the key values are assigned.
> Please, let me understand it..
>
> Thanks, have a nice day~~~
>
> -----원본 메시지-----
> *보낸 사람:* "Frank Dabek" <fdabek at MIT.EDU>
> *보낸 날짜:* 2004-01-29 오전 6:52:13
> *받는 사람:* "진명 희" <ppuny79 at korea.com>
> *제목:* Re: [chord] Question on Chord: A Scalable Peer-to-peer.....
>
>
>The recente efforts to crack the RC5 cipher using a distributed network
>of volunteers are an example this type of application. Instead of using
>a central server to distribute parts of the keyspace one could imagine
>using chord to maintain, in a dencentralized fashion, the range of keys
>each node should search: i.e. try all of the keys between yourself and
>your successor.
>
>--Frank
>
>On Wed, 2004-01-28 at 04:55, 진명희 wrote:
>> Hi~
>> May I ask a question on Chord?
>> I couldn't understand 'Large-Scale Combinatorial Search' on page 3 of
>> the paper Chord.
>> Would you give me an example about it?
>> 
>> Thanks~~~
>> 
>> 
>> 
>> 
>> ______________________________________________________________________
>> _______________________________________________
>> chord mailing list
>> chord at amsterdam.lcs.mit.edu
>> https://amsterdam.lcs.mit.edu/mailman/listinfo/chord
>
>
>
>------------------------------------------------------------------------
>
>_______________________________________________
>chord mailing list
>chord at amsterdam.lcs.mit.edu
>https://amsterdam.lcs.mit.edu/mailman/listinfo/chord
>  
>