-
6
-
-
85092898866
-
High availability, scalable storage, dynamic peer networks: Pick two
-
C. Blake, and R. Rodrigues High availability, scalable storage, dynamic peer networks: pick two Proceedings of the HotOS IX 2003
-
(2003)
Proceedings of the HotOS IX
-
-
Blake, C.1
Rodrigues, R.2
-
9
-
-
0036041927
-
Wide-area cooperative storage with CFS
-
Banff, Canada
-
F. Dabek, F. Kaashoek, D. Karger, R. Morris, and I. Stoica Wide-area cooperative storage with CFS Proceedings of the ACM SOSP Banff, Canada 2001
-
(2001)
Proceedings of the ACM SOSP
-
-
Dabek, F.1
Kaashoek, F.2
Karger, D.3
Morris, R.4
Stoica, I.5
-
10
-
-
0012612933
-
Competitive hill-climbing strategies for replica placement in a distributed file system
-
J.R. Douceur, and R.P. Wattenhofer Competitive hill-climbing strategies for replica placement in a distributed file system Proceedings of the DISC 2001
-
(2001)
Proceedings of the DISC
-
-
Douceur, J.R.1
Wattenhofer, R.P.2
-
12
-
-
2442461224
-
Measurement modeling and analysis of a peer-to-peer file-sharing workload
-
K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan Measurement modeling and analysis of a peer-to-peer file-sharing workload Proceedings of the SOSP 2003
-
(2003)
Proceedings of the SOSP
-
-
Gummadi, K.P.1
Dunn, R.J.2
Saroiu, S.3
Gribble, S.D.4
Levy, H.M.5
Zahorjan, J.6
-
14
-
-
0030704545
-
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web
-
May
-
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 Proceedings of the ACM STOC May 1997
-
(1997)
Proceedings of the ACM STOC
-
-
Karger, D.1
Lehman, E.2
Leighton, T.3
Levine, M.4
Lewin, D.5
Panigrahy, R.6
-
15
-
-
8344284362
-
New algorithms for load balancing in peer-to-peer systems
-
MIT LCS, July
-
D. Karger, M. Ruhl, New algorithms for load balancing in peer-to-peer systems, Technical Report MIT-LCS-TR-911, MIT LCS, July 2003.
-
(2003)
Technical Report
, vol.MIT-LCS-TR-911
-
-
Karger, D.1
Ruhl, M.2
-
16
-
-
8344230668
-
Simple efficient load balancing algorithms for peer-to-peer systems
-
D. Karger, and M. Ruhl Simple efficient load balancing algorithms for peer-to-peer systems Proceedings of the SPAA 2004
-
(2004)
Proceedings of the SPAA
-
-
Karger, D.1
Ruhl, M.2
-
17
-
-
28244445647
-
Randomized ID selection for peer to peer networks
-
G. Manku Randomized ID selection for peer to peer networks Proceedings of the PODC 2004
-
(2004)
Proceedings of the PODC
-
-
Manku, G.1
-
18
-
-
0037703386
-
Novel architectures for P2P applications: The continuous-discrete approach
-
M. Naor, and U. Wieder Novel architectures for P2P applications: the continuous-discrete approach Proceedings of the SPAA 2003
-
(2003)
Proceedings of the SPAA
-
-
Naor, M.1
Wieder, U.2
-
22
-
-
0003007594
-
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
-
A. Rowstron, and P. Druschel Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems Proceedings of the Middleware 2001
-
(2001)
Proceedings of the Middleware
-
-
Rowstron, A.1
Druschel, P.2
-
24
-
-
0034782005
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
San Diego
-
I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan Chord: a scalable peer-to-peer lookup service for internet applications Proceedings of the ACM SIGCOMM San Diego 2001 149 160
-
(2001)
Proceedings of the ACM SIGCOMM
, pp. 149-160
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, M.F.4
Balakrishnan, H.5
|