Analysis of parallel downloading for large file distribution

Proceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems

Volumn 2003-January, Issue , 2003, Pages 128-135

  Koo, S G M ^a   Rosenberg, C ^a   Xu, Dongyan ^b  

^a Purdue University   (United States)

^b Purdue University   (United States)

Author keywords

Analytical models; Application software; Computer science; Concurrent computing; Intelligent networks; Internet; Network servers; Peer to peer computing; Throughput; Tornadoes

Indexed keywords

ANALYTICAL MODELS; APPLICATION PROGRAMS; COMPLEX NETWORKS; COMPUTER SCIENCE; CONCURRENCY CONTROL; INTELLIGENT NETWORKS; INTERNET; MOBILE TELECOMMUNICATION SYSTEMS; PEER TO PEER NETWORKS; THROUGHPUT; TORNADOES;

CONCURRENT COMPUTING; CONTENT DISTRIBUTION NETWORKS; IN-DEPTH UNDERSTANDING; LARGE-SCALE DEPLOYMENT; NETWORK DIMENSIONING; NETWORK SERVER; PEER-TO-PEER COMPUTING; SIMULATION AND ANALYSIS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84945174709     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FTDCS.2003.1204324     Document Type: Conference Paper

References (16)

1. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed Content Delivery Across Adaptive Overlay Networks. In Proc. of ACM SIGCOMM, 2002.
2. J. W. Byers, M. Luby, and M. Mitzenmacher. Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. In Proc. of INFOCOM, pages 275-283, New York, NY, Mar. 1999.
3. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A Digital Fountain Approach to Reliable Distribution of Bulk Data. In Proc. of ACM SIGCOMM, pages 56-67, Vancouver, Canada, 1998.
4. R. L. Carter and M. Crovella. Server Selection Using Dynamic Path Characterization in Wide-Area Networks. In Proc. of INFOCOM, volume 3, pages 1014-1021, Kobe, Japan, Apr. 1997.
5. Digital Fountain Inc. Digital Fountain's Meta-Content Technology. White Paper.
6. Z. Fei, S. Bhattacharjee, E. W. Zegura, and M. H. Ammar. A Novel Server Selection Technique for Improving the Response Time of a Replicated Service. In Proc. of INFOCOM, volume 2, pages 783-791, 1998.
7. L. Kleinrock. Queueing System, volume 2 (Computer Applications). John Wiley and Sons, first edition, Apr. 1976.
8. Y. Liu, W. Gong, and P. Shenoy. On the Impact of Concurrent Downloads. In 2001 Winter Simulation Conference, Arlington, VA, 2001.
9. A. Myers, P. A. Dinda, and H. Zhang. Performance Characteristics of Mirror Servers on the Internet. In Proc. of INFOCOM, volume 1, pages 304-312, 1999.
10. Y. Nebat and M. Sidi. Resequencing Considerations in Parallel Downloads. In Proc. of INFOCOM, 2002.
11. S. Philopoulos and M. Maheswaran. Experimental Study of Parallel Downloading Schemes for Internet Mirror Sites. In Thirteenth IASTED International Conference on Parallel and Distributed Computing Systems (PDCS '01), pages 44-48, Aug. 2001.
12. P. Rodriguez and E. Biersack. Dynamic parallelaccess to replicated content in the Internet. IEEE/ACM Transactions on Networking, 10(4), Aug. 2002.
13. M. Sakata, S. Noguchi, and J. Oizumi. An Analysis of the M/G/1 Queue Under Round-Robin Scheduling. Operations Research, 19:317-385, 1971.
14. S. Saroiu, K. P. Gummadi, R. J. Dunn, S. D. Gribble, and H. M. Levy. An analysis of internet content delivery systems. In Proc. of the Fifth Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec. 2002.
15. D. Villela and D. Rubenstein. A Queuing Analysis of Server Sharing Collectives for Content Distribution. Technical Report EE200412-1, Columbia University, Apr. 2002.
16. A. Zeitoun, H. Jamjoom, and M. El-Gendy. Scalable Parallel-Access For Mirrored Servers. In The 20th IASTED International Conference on Applied Informatics (AI 2002), Innsbruck, Austria, Feb. 2002.