A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Bistro: a framework for building scalable wide-area Upload applications
ACM SIGMETRICS Performance Evaluation Review
A performance study of Bistro, a scalable upload architecture
ACM SIGMETRICS Performance Evaluation Review
An Experimental Study of Adaptive Forward Error Correction for Wireless Collaborative Computing
SAINT '01 Proceedings of the 2001 Symposium on Applications and the Internet (SAINT 2001)
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Hi-index | 0.00 |
This paper investigates fault tolerance issues in Bistro, a wide area upload architecture. In Bistro, clients first upload their data to intermediaries, known as bistros. A destination server then pulls data from bistros as needed. However, during the server pull process, bistros can be unavailable due to failures, or they can be malicious, i.e., they might intentionally corrupt data. This degrades system performance since the destination server may need to ask for retransmissions. As a result, a fault tolerance protocol is needed within the Bistro architecture. Thus, in this paper, we develop such a protocol which employs erasure codes in order to improve the reliability of the data uploading process. We develop analytical models to study reliability and performance characteristics of this protocol, and we derive a cost function to study the tradeoff between reliability and performance in this context. We also present numerical results to illustrate this tradeoff.