Erasure code replication revisited

被引：57

作者：

Lin, WK ^{[1
]}

Chiu, DM ^{[1
]}

Lee, YB ^{[1
]}

机构：

[1] Chinese Univ Hong Kong, Dept Informat Engn, Sha Tin 100083, Peoples R China

来源：

FOURTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/PTP.2004.1334935

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Erasure coding is a technique for achieving high availability and reliability in storage and communication systems. In this paper, we revisit the analysis of erasure code replication and point out some situations when whole file replication is preferred. The switchover point (from preferring whole-file replication to erasure code replication) is studied, and characterized using asymptotic analysis. We also discuss the additional considerations in building erasure code replication systems.

引用

页码：90 / 97

页数：8

共 13 条

[1]

Bhagwan R., 2003, P 2 INT WORKSH PEER

[2]

BHAGWAN R, 2002, P FUD FUT DIR DISTR

[3]

BLAKE C, 2003, P 9 WORKSH HOT TOP O

[4]

BOLOSKY, P SIGM 2000

[5]

CLARKE I, 2000, P ICSI WORKSH DES IS

[6] Study of a server-less architecture for video-on-demand applications [J].

Lee, JYB ;

Leung, RWT .

IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOL I AND II, PROCEEDINGS, 2002, :233-236

[7]

LEE TT, 1993, GLOBECOM '93 COMMUNICATIONS FOR A CHANGING WORLD, CONFERENCE RECORD, P442, DOI 10.1109/GLOCOM.1993.318042

[8]

Padmanabhan V. N., 2003, IEEE ICNP

[9]

PADMANABHAN VN, 2002, P 1 INT WORKSH PEER

[10]

PATTERSON DA, 1988, ACM SIGMOD

← 1 2 →