[p2p-hackers] Node counting algorithm

[Enzo Michelangeli]

----- Original Message ----- 
From: "Michael Parker" <mgp at ucla.edu>
To: "Peer-to-peer development." <p2p-hackers at zgp.org>
Sent: Thursday, February 24, 2005 2:27 AM
Subject: Re: [p2p-hackers] Node counting algorithm

> Interestingly enough, the topology of some DHTs makes this not too
> difficult to calculate. In Pastry/Bamboo, for example:
[...]
> Finally, although I'm no Kademlia expert, I think you can estimate the
> size of the network by 2^k, where k is the number of buckets in your
> routing table.

More accurately, by the number of nodes contained in each k-bucket.
Each k-bucket gets full after k nodes, and that clips its contribution to
k; however, partially-filled k-buckets do contribute useful information.
See e.g. my posting archived at
http://zgp.org/pipermail/p2p-hackers/2004-June/001991.html , so far with
no followup.

Enzo