期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2013
卷号：4
期号：3
页码：396-399
出版社：Technopark Publications
摘要：The many-to-one upload trouble arises when many of users needs to upload data to a single server. Uploads correspond to an important class of scenarios, many of which are limited by a deadline. This includes, e.g., electronic submissions of income tax forms, online shopping for limited-time bargain products, and gathering data from sensor networks. Such services create hot spots, which is a major hurdle in achieving scalability in network-based applications. Two-tier protocols attempt to relieve hot spots in many-to-one applications. In this model, clients upload their data to intermediaries (also called bistros), to reduce the traffic to the destination around a deadline. The destination server then computes a schedule for pulling the data from bistros after the deadline. Bistros have limited storage capacity, and each bistro j may fail with some probability 0 < pj < 1. Previous works on reliable data upload report on experimental results. Our main contribution is a theoretical study of several algorithms for the many-to-one upload problem in two-tier protocols. The proposed algorithms achieve reliability through file replication, or by using Forward-error correction codes (FEC).
