Bibliography

1

M. Adler, E. Halperin, R. Karp, and V. Vazirani.
A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks.
In STOC 2003, San Diego, CA, June 2003.

2

C. Blake and R. Rodrigues.
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two.
In Proceedings of HotOS IX, Lihue, HI, May 2003.

3

F. Bustamante and Y. Qiao.
Friendships that last: Peer lifespan and its role in P2P protocols.
In Eighth International Workshop on Web Content Caching and Distribution, Hawthorne, NY, October 2003.

4

J. Byers, J. Considine, and M. Mitzenmacher.
Simple Load Balancing for Distributed Hash Tables.
In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03), Berkeley, CA, February 2003.

5

J. Byers, J. Considine, and M. Mitzenmacher.
Geometric Generalizations of the Power of Two Choices.
In SPAA 2004, Barcelona, Spain, June 2004.

6

M. Castro, M. Costa, A. Kermarrec, and A. Rowstron.
SimPastry.
http://www.research.microsoft.com/~antr.

7

M. Castro, M. Costa, and A. Rowstron.
Performance and Dependability of Structured Peer-to-Peer Overlays.
In Dependable Systems and Networks, Florence, Italy, June 2004.

8

M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh.
SplitStream: High-Bandwidth Multicast in Cooperative Environments.
In Proceedings of the 19th ACM SOSP, Bolton Landing, NY, October 2003.

9

M. Castro, P. Drushel, A. Ganesh, A. Rowstron, and D. Wallach.
Secure Routing for Structured Peer-to-Peer Overlay Networks.
In OSDI '02, Boston, MA, 2002.

10

L. Cox and B. Noble.
Samsara: Honor Among Thieves in Peer-to-Peer Storage.
In Proceedings of the 19th ACM SOSP, Bolton Landing, NY, October 2003.

11

M. E. Crovella and L. Lipsky.
Long-lasting transient conditions in simulations with heavy-tailed workloads.
In Proceedings of the 1997 Winter Simulation Conference, December 1997.

12

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica.
Wide-area cooperative storage with CFS.
In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October 2001.

13

R. Dingledine, N. Mathewson, and P. Syverson.
Reputation in P2P Anonymity Systems.
In Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, June 2003.

14

J. Douceur.
The Sybil Attack.
In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, March 2002.

15

P. Druschel, R. Gil, Y. Hu, S. Iyer, A. Ladd, A. Mislove, A. Nandi, A. Post, C. Reis, A. Singh, and R. Zhang.
Rice FreePastry implementation.
http://www.cs.rice.edu/CS/Systems/Pastry/FreePastry.

16

P. Druschel and A. Rowstron.
PAST: A large-scale, persistent peer-to-peer storage utility.
In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October 2001.

17

D. Ellard, J. Ledlie, P. Malkani, and M. Seltzer.
Passive NFS tracing of Email Workloads.
In Proceedings of the 2003 USENIX Conference on File and Storage Technology, San Francisco, CA, March 2003.

18

L. Fan, P. Cao, J. Almeida, and A. Z. Broder.
Summary cache: a scalable wide-area web cache sharing protocol.
IEEE/ACM Transactions on Networking, 2000.

19

J. Feigenbaum and S. Shenker.
Distributed Algorithmic Mechanism Design: Recent Results and Future Directions.
In Sixth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, September 2002.

20

P. Ganesan, M. Bawa, and H. Garcia-Molina.
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems.
In VLDB 2004, Toronto, September 2004.

21

T. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling.
p2psim.
http://www.pdos.lcs.mit.edu/p2psim/.

22

B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica.
Load Balancing in Dynamic Structured P2P Systems.
In INFOCOM 2004, Hong Kong, March 2004.

23

B. Gross and A. Acquisti.
Balances of Power on eBay: Peers or Unequals?
In Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, June 2003.

24

K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan.
Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload.
In Proceedings of the 19th ACM SOSP, Bolton Landing, NY, October 2003.

25

D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy.
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
In ACM Symposium on Theory of Computing, El Paso, TX, May 1997.

26

D. Karger and M. Ruhl.
Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems.
In SPAA 2004, Barcelona, Spain, June 2004.

27

J. Ledlie and M. Seltzer.
Distributed, secure load balancing with skew, heterogeneity, and churn.
Technical Report TR-31-04, Harvard University, December 2004.

28

J. Ledlie, J. Taylor, L. Serban, and M. Seltzer.
Self-organization in peer-to-peer systems.
In Tenth SIGOPS European Workshop, September 2002.

29

D. Liben-Nowell, H. Balakrishnan, and D. Karger.
Analysis of the Evolution of Peer-to-Peer Networks.
In PODC 2002, July 2002.

30

G. S. Manku.
Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables.
In PODC 2004, St. John's, Newfoundland, Canada, July 2004.

31

M. Mitzenmacher, A. Richa, and R. Sitaraman.
The Power of Two Choices: A Survey of Techniques and Results.
Kluwer Academic Publishers, Norwell, MA, 2001.

32

M. Naor and U. Wieder.
Novel Architectures for P2P Applications: the Continuous-Discrete Approach.
In Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures SPAA, San Diego, CA, June 2003.

33

G. Pandurangan, P. Raghavan, and E. Upfal.
Building low-diameter p2p networks.
In IEEE Symposium on Foundations of Computer Science, pages 492-499, 2001.

34

P. Pietzuch and S. Bhola.
Congestion Control in a Reliable Scalable Message-Oriented Middleware.
In Middleware 2003, Rio de Janeiro, Brazil, June 2003.

35

A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica.
Load Balancing in Structured P2P Systems.
In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03), Berkeley, CA, February 2003.

36

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker.
A Scalable Content-Addressable Network.
In Proceedings of the ACM SIGCOMM '01 Conference, August 2001.

37

M. Roussopoulos and M. Baker.
Practical Load Balancing for Content Requests in Peer-to-Peer Networks.
Research Report cs.NI/0209023, Stanford University, January 2003.

38

A. Rowstron and P. Druschel.
Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems.
In Middleware, November 2001.

39

S. Saroiu, K. P. Gummadi, R. J. Dunn, S. D. Gribble, , and H. M. Levy.
An analysis of internet content delivery systems.
In Proceedings of 5th Symposium on Operating Systems Design and Implementation (OSDI '02), Boston, MA, December 2002.

40

S. Saroiu, P. K. Gummadi, and S. D. Gribble.
A measurement study of peer-to-peer file sharing systems.
In Proceedings of the Multimedia Computing and Networking (MMCN), San Jose, CA, January 2002.

41

J. Shneidman and D. Parkes.
Specification Faithfulness in Networks with Rational Nodes.
In PODC 2004, July 2004.

42

I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana.
Internet Indirection Infrastructure.
In SIGCOMM '02, Pittsburg, PA, August 2002.

43

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan.
Chord: A scalable peer-to-peer lookup service for internet applications.
In Proceedings of the ACM SIGCOMM '01 Conference, August 2001.

44

B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, , and A. Joglekar.
An integrated experimental environment for distributed systems and networks.
In Proceedings of 5th Symposium on Operating Systems Design and Implementation (OSDI '02), Boston, MA, December 2002.

45

B. Wilcox-O'Hearn.
Experiences deploying a large-scale emergent network.
In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, March 2002.

46

B. Yan and H. Garcia-Molina.
PPay: Micropayments for Peer to Peer Systems.
In ACM Conference on Computer and Communications Security, Washington, D.C., October 2003.

47

B. Zhao, J. Kubiatowicz, and A. Joseph.
Tapestry: An infrastructure for fault-tolerant wide-area location and routing.
Research Report UCB/CSD-01-1141, U.C. Berkeley, April 2001.