A fault tolerance protocol for uploads: design and evaluation

  • Authors:
  • L. Cheung;C. -F. Chou;L. Golubchik;Y. Yang

  • Affiliations:
  • Computer Science Department, University of Southern California, Los Angeles, CA;Department of Computer Science and Information Engineering, National Taiwan University;Computer Science Department, EE-Systems Department, IMSC, and ISI, University of Southern California, Los Angeles, CA;Computer Science Department, University of Southern California, Los Angeles, CA

  • Venue:
  • ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.