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.
This work is supported in part by the NSF Digital Government Grant 0091474. It has also been funded in part by the Integrated Media Systems Center, a National Science Foundation Engineering Research Center, Cooperative Agreement No. EEC-9529152. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect those of the National Science Foundation. More information about the Bistro project can be found at http://bourbon.usc.edu/iml/bistro.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhattacharjee, S., Cheng, W.C., Chou, C.F., Golubchik, L., Khuller, S.: Bistro: a framework for building scalable wide-area upload applications. ACM SIGMETRICS Performance Evaluation Review 28, 29–35 (2000)
Cheng, W.C., Chou, C.F., Golubchik, L., Khuller, S.: A secure and scalable wide-area upload service. In: Proceedings of 2nd International Conference on Internet Computing, vol. 2, pp. 733–739 (2001)
Patterson, D.A., Gibson, G., Katz, R.H.: A case for redundant arrays of inexpensive disks (raid). In: Proceedings of the 1988 ACM SIGMOD international conference on Management of data, pp. 109–116. ACM Press, New York (1988)
Byes, J., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: ACM SIGCOMM (1998)
Ding, G., Ghafoor, H., Bhargava, B.: Resilient video transmission over wireless networks. In: 6th IEEE International Conf. on Object-oriented Real-time Distributed Computing (2003)
McKinley, P., Mani, A.: An experimental study of adaptive forward error correction for wireless collaborative computing. In: IEEE Symposium on Applications and the Internet, SAINT 2001 (2001)
Cheng, W.C., Chou, C.F., Golubchik, L., Khuller, S.: A performance study of bistro, a scalable upload architecture. ACM SIGMETRICS Performance Evaluation Review 29, 31–39 (2002)
Cheung, L., Chou, C.F., Golubchik, L., Yang, Y.: A fault tolerance for uploads: Design and evaluation. Technical Report 04-834, Computer Science Department, University of Southern California (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheung, L., Chou, C.F., Golubchik, L., Yang, Y. (2004). A Fault Tolerance Protocol for Uploads: Design and Evaluation. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-30566-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24128-7
Online ISBN: 978-3-540-30566-8
eBook Packages: Computer ScienceComputer Science (R0)