-
1
-
-
0031190710
-
Space filling curves and their use in geometric data structure
-
July
-
T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmaier. Space filling curves and their use in geometric data structure. Theoretical Computer Science, 181(1):3-15, July 1997.
-
(1997)
Theoretical Computer Science
, vol.181
, Issue.1
, pp. 3-15
-
-
Asano, T.1
Ranjan, D.2
Roos, T.3
Welzl, E.4
Widmaier, P.5
-
3
-
-
0036041927
-
Wide-area cooperative storage with CFS
-
Banff, Canada, Oct.
-
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), pages 202-215, Banff, Canada, Oct. 2001.
-
(2001)
Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01)
, pp. 202-215
-
-
Dabek, F.1
Kaashoek, M.F.2
Karger, D.3
Morris, R.4
Stoica, I.5
-
6
-
-
0034775826
-
A scalable content-addressable network
-
San Diego, CA, Aug.
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, pages 161-172, San Diego, CA, Aug. 2001.
-
(2001)
Proceedings of ACM SIGCOMM
, pp. 161-172
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker5
-
7
-
-
0036343302
-
Topologicallyaware overlay construction and server selection
-
New York, NY, June
-
S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologicallyaware overlay construction and server selection. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), New York, NY, June 2002.
-
(2002)
Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)
-
-
Ratnasamy, S.1
Handley, M.2
Karp, R.3
Shenker, S.4
-
8
-
-
0003007594
-
Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
-
Heidelberg, Germany, Nov.
-
A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms (Middleware 2001), Heidelberg, Germany, Nov. 2001.
-
(2001)
Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms (Middleware 2001)
-
-
Rowstron, A.1
Druschel, P.2
-
9
-
-
0038404059
-
A measurement study of peer-to-peer file sharing systems
-
San Jose, CA, Jan.
-
S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking, San Jose, CA, Jan. 2002.
-
(2002)
Proceedings of Multimedia Computing and Networking
-
-
Saroiu, S.1
Gummadi, P.K.2
Gribble, S.D.3
-
10
-
-
0034782005
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
San Diego, CA, Aug.
-
I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, pages 149-160, San Diego, CA, Aug. 2001.
-
(2001)
Proceedings of ACM SIGCOMM
, pp. 149-160
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, M.4
Balakrishnan, H.5
-
14
-
-
0029780013
-
How to model an internetwork
-
San Francisco, CA, Mar. IEEE.
-
E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE INFOCOM, volume 2, pages 594-602, San Francisco, CA, Mar. 1996. IEEE.
-
(1996)
Proceedings of IEEE INFOCOM
, vol.2
, pp. 594-602
-
-
Zegura, E.W.1
Calvert, K.L.2
Bhattacharjee, S.3
-
16
-
-
0003858844
-
Tapestry: An infrastructure for fault-tolerance wide-area location and routing
-
Computer Science Division, University of California, Berkeley, Apr.
-
B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerance wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley, Apr. 2001.
-
(2001)
Technical Report
, vol.UCB-CSD-01-1141
-
-
Zhao, B.Y.1
Kubiatowicz, J.D.2
Joseph, A.D.3
-
17
-
-
12444308750
-
Efficient, proximity-aware load balancing for structured peer-to-peer systems
-
University of Cincinnati
-
Y. Zhu and Y. Hu. Efficient, proximity-aware load balancing for structured peer-to-peer systems. Technical Report TR-270/04/03/ECECS, University of Cincinnati, 2003.
-
(2003)
Technical Report
, vol.TR-270-04-03-ECECS
-
-
Zhu, Y.1
Hu, Y.2
|