Information Technology Reference
In-Depth Information
Using similar derivations, we can obtain the corresponding bounds for
Z
as follows:
f
+
−
f
−
+
T
L
+
τ
+
D
F
Z
Before
=
+
1
(11.78)
T
a
v
g
f
+
−
f
−
+
T
L
+
τ
Z
After
=
+
1
(11.79)
T
a
v
g
References
[1] S.B. Wicker,
Error Control Systems for Digital Communication and Storage
, Prentice-Hall, 1995, pp. 227-34.
[2] J.S. Plank, A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems,
Software Practice
and Experience
, vol. 27, no. 9, Sep. 1997, pp. 995-1012.
[3] L. Rizzo, Effective Erasure Codes for Reliable Computer Communication Protocols,
ACM Computer Communi-
cation Review
, vol. 27, no. 2, Apr. 1997, pp. 24-36.
[4] D.A. Patterson, P. Chen, G. Gibson, and R.H. Katz, Introduction to Redundant Array of Inexpensive Disks (RAID),
COMPCON Spring'89
, 1989, pp. 112-117.
Search WWH ::
Custom Search