Building peer-to-peer systems with Chord, a distributed lookup service

被引：35

作者：

Dabek, F ^{[1
]}

Brunskill, E ^{[1
]}

Kaashoek, MF ^{[1
]}

Karger, D ^{[1
]}

Morris, R ^{[1
]}

Stoica, I ^{[1
]}

Balakrishnan, H ^{[1
]}

机构：

[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA

来源：

EIGHTH WORKSHOP ON HOT TOPICS IN OPERATING SYSTEMS, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/HOTOS.2001.990065

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We argue that the core problem facing peer-to-peer systems is locating documents in a decentralized network and propose Chord, a distributed lookup primitive. Chord provides an efficient method of locating documents while placing few constraints on the applications that use it. As proof that Chord's functionality is useful in the development of peer-to-peer applications, we outline the implementation of a peer-to-peer file sharing system based on Chord.

引用

页码：81 / 86

页数：6

共 14 条

[1]

Bindel D., 2000, P 9 INT C ARCH SUPP

[2] UNTRACEABLE ELECTRONIC MAIL, RETURN ADDRESSES, AND DIGITAL PSEUDONYMS [J].

CHAUM, DL .

COMMUNICATIONS OF THE ACM, 1981, 24 (02) :84-88

[3]

CLARK I, 1999, THESIS U EDINBURGH

[4]

Clarke I., 2000, P WORKSH DES ISS AN

[5]

DINGLEDINE R, 2000, P WORKSH DES ISS AN

[6]

FU MK, 2000, P 4 USENIX S OP SYST, P181

[7]

Karger David., 1997, P 29 ANN ACM S THEOR, P654, DOI [10.1145/258533.258660, DOI 10.1145/258533.258660]

[8]

Li J., 2000, P OFIEEEACM MOBICOM, P120130, DOI DOI 10.1145/345910.345931

[9]

Mazières D, 1999, OPERATING SYSTEMS REVIEW, VOL 33, NO 5, DECEMBER 1999, P124, DOI 10.1145/319344.319160

[10]

PLAXTON CG, 1997, P 9 ANN ACM S PAR AL, P311, DOI DOI 10.1145/258492.258523

← 1 2 →