Resequencing considerations in parallel downloads

Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. This paper formulates models for an approach based on receiving only one copy of each of the data packets in a file, while different packets may be obtained from different sources. This approach guarantees faster downloads with lower network use. However, out-of-order arrivals at the receiving side are unavoidable. We present methods to keep out-of-order low to insure more regulated flow of packets to the application. Recent papers indicate that out-of-order arrivals have many unfavorable consequences. A good indicator to the severeness of out-of-order arrival is the resequencing-buffer occupancy. The paper focuses on the analysis of the resequencing-buffer occupancy distribution and on the analysis of the methods used to reduce the occupancy of the buffer.

[1]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[2]  A. G. Pakes,et al.  Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..

[3]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Peter Scheuermann,et al.  Selection algorithms for replicated Web servers , 1998, PERV.

[5]  Mabel Tidball,et al.  On the Influence of Resequencing on the Regularity of Service , 1999, Perform. Evaluation.

[6]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[7]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

[8]  Pablo Rodriguez,et al.  Parallel-access for mirror sites in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Craig Partridge,et al.  Packet reordering is not pathological network behavior , 1999, TNET.

[10]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

[11]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[13]  Kevin C. Almeroth,et al.  Scalable delivery of Web pages using cyclic best-effort multicast , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Zvi Rosberg,et al.  Resequencing delay and buffer occupancy under the selective-repeat ARQ , 1989, IEEE Trans. Inf. Theory.