Estimating network size from local information

Abraham, 2003, A generic scheme for building overlay networks in adversarial scenarios Abraham, 2003, Probabilistic quorums for dynamic systems Barriére, 2001, Efficient routing in networks with long range contacts, 2180, 270 Drushel, 2001, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems P. Fraigniaud, P. Gauron, The content-addressable network D2B, Technical Report 1349, LRI, Univ. Paris-Sud, France, January 2003 Kaashoek, 2003, Koorde: A simple degree-optimal hash table Kearns, 1994 Kleinberg, 2000, The small world phenomenon: An algorithmic perspective, 163 Malkhi, 2002, Viceroy: A scalable and dynamic emulation of the Butterfly Manku, 2003, Symphony: Distributed hashing in small world Motwani, 1995 Mulmuley, 1994 Naor, 2003, Novel architectures for P2P applications: the continuous-discrete approach Plaxton, 1997, Accessing nearby copies of replicated objects in a distributed environment, 311 Ratnasamy, 2001, A scalable content-addressable network Stoica, 2001, Chord: A scalable peer-to-peer lookup service for Internet applications B.Y. Zhao, J.D. Kubiatowicz, A.D. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, U.C. Berkeley Technical Report UCB/CDS-01-1141, April 2001