Parallel downloads for streaming applications - A resequencing analysis

Performance Evaluation

Volumn 63, Issue 1, 2006, Pages 15-35

  Nebat, Yoav ^a,b   Sidi, Moshe ^a,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Department of Electrical Engineering ^*  (Israel)

Author keywords

Mirror server; Out of order arrival; Parallel download; Resequencing

Indexed keywords

MIRROR SERVER; OUT-OF-ORDER ARRIVAL; PARALLEL DOWNLOAD; RESEQUENCING;

DATA STORAGE EQUIPMENT; INFORMATION RETRIEVAL; PERFORMANCE; PROBABILITY; SERVERS;

PARALLEL PROCESSING SYSTEMS;

EID: 27144480296     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.11.006     Document Type: Article

References (18)

1. Z. Fei, S. Bhattacharjee, E.W. Zegura, M.H. Ammar, A Novel Server Selection Technique for Improving the Response Time of a Replicated Service, INFOCOM'98, pp. 783-791.
2. R.L. Carter, M.E. Crovella, Server Selection Using Dynamic Path Characterization in Wide-Area Networks, INFOCOM'97, pp. 1014-1021.
3. M. Sayal, Y. Breitbart, P. Scheuermann, R. Vingralek, Selection Algorithms for Replicated Web Servers, Workshop on Internet Server Performance Madison, Wisconsin, 1998.
4. S. Seshan, M. Stemm, and R.H. Katz SPAND: shared passive network performance discovery Proceedings of USENIX Symposium on Internet Technologies and Systems Monterey, CA 1997
5. J.W. Byers, M. Luby, M. Mitzenmacher, Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speedup Downloads, INFOCOM'99, pp. 275-283.
6. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann Practical loss-resilient codes' Proceedings of the 29th annual ACM Symposium on Theory of Computing 1997 150 159
7. L. Rizzo Effective erasure codes for reliable computer communication protocols Computer Commun. Rev. 27 2 April 1997 24 36
8. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege A digital fountain approach to reliable distribution of bulk data Proceedings of ACM SIGCOMM 1998 56 67
9. J. Byers, J. Considine, M. Mitzenmacher, S. Rost, Informed Content Delivery Across Adaptive Overlay Networks, SIGCOMM'02, pp. 47-60.
10. K.C. Almeroth, M.H. Ammar, Z. Fei, Scalable Delivery of Web Pages Using Cyclic Best-Effort Multicast, INFOCOM'98, pp. 1214-1221.
11. A. Jean-Marie, M. Tidball, M. Escalante, V. Leoni, and H. Ponce de Leon On the influence of resequencing on the regularity of service Perform. Eval. J. 36-37 1999 115 135
12. P. Rodriguez, and E.W. Biersack Dynamic parallel access to replicated content in the Internet IEEE/ACM Trans. Netw. 10 4 August 2002 455 465
13. Y. Nebat, and M. Sidi Analysis of resequencing in downloads Int. J. Commun. Syst. 16 2003 735 757
14. A.G. Pakes Some conditions for ergodicity and recurrence of Markov chains Operations Res. 17 1969 1058 1061
15. F. Baccelli, and A.M. Makowski Queueing models for systems with synchronization constraints Proc. IEEE 77 1 1989 138 161
16. Z. Rosberg, and N. Shacham Resequencing delay and buffer occupancy under the selective-repeat ARQ IEEE Trans. Inform. Theory 35 1 1989 166 173
17. J. Berster Recent results in Sturmian words J. Dassow A. Salomaa Development in Language Theory 1996 World Scientific Singapore 13 24
18. Y. Nebat, M. Sidi, Resequencing Considerations in Parallel Downloads, CCIT Report #348, Electrical Engineering Dept., Technion, Haifa, Israel, July 2001.