On the effect of large-scale deployment of parallel downloading

被引:22
作者
Gkantsidis, C [1 ]
Ammar, M [1 ]
Zegura, E [1 ]
机构
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
来源
WIAPP 2003: THIRD IEEE WORKSHOP ON INTERNET APPLICATIONS, PROCEEDINGS | 2003年
关键词
D O I
10.1109/WIAPP.2003.1210291
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the presence of multiple mirror servers that can serve the same information, clients can improve their performance when downloading large files by conncurrently retrieving different parts of the file from different servers. In previous work, experiments with a single client have shown the potential for parallel downloading schemes to improve the performance perceived by this single client. In this paper we consider the question of what happens when parallel downloading is widely adopted within the Internet. To that end we start with an experimental evaluation of various parallel downloading schemes and their performance from the perspective of a single client. We use these results as a benchmark for a set of simulations in which we investigate the performance of parallel downloading when performed by multiple clients. We find that, because parallel downloading incurs additional overhead as a result of its use of more network connections, large-scale use of this technique can actually lead to overall degradation of the performance experienced by clients. Further, we uncover a 'fairness" tradeoff in that any performance improvement experienced by clients performing parallel downloading comes at the expense of clients who simply go to a single server to retrieve files.
引用
收藏
页码:79 / 89
页数:11
相关论文
共 13 条
[1]  
ALLMAN WSM, 1999, 2581 IETF RFC
[2]   Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads [J].
Byers, JW ;
Luby, M ;
Mitzenmacher, M .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :275-283
[3]   PERFORMANCE EVALUATION OF FORK AND JOIN SYNCHRONIZATION PRIMITIVES [J].
DUDA, A ;
CZACHORSKI, T .
ACTA INFORMATICA, 1987, 24 (05) :525-553
[4]  
HEIDELBERGER P, 1983, IEEE T COMPUT, V32, P73, DOI 10.1109/TC.1983.1676125
[5]  
Jia Wang, 1999, Computer Communication Review, V29, P36, DOI 10.1145/505696.505701
[6]   A DECOMPOSITION PROCEDURE FOR THE ANALYSIS OF A CLOSED FORK JOIN QUEUING SYSTEM [J].
LIU, YC ;
PERROS, HG .
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (03) :365-370
[7]  
LUI JCS, 1994, CSTR9409
[8]   Performance characteristics of mirror servers on the Internet [J].
Myers, A ;
Dinda, P ;
Zhang, H .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :304-312
[9]   APPROXIMATE ANALYSIS OF FORK JOIN SYNCHRONIZATION IN PARALLEL QUEUES [J].
NELSON, R ;
TANTAWI, AN .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (06) :739-743
[10]   EFFICIENT DISPERSAL OF INFORMATION FOR SECURITY, LOAD BALANCING, AND FAULT TOLERANCE [J].
RABIN, MO .
JOURNAL OF THE ACM, 1989, 36 (02) :335-348