Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
DOI: 10.1109/infcom.2002.1019383
|View full text |Cite
|
Sign up to set email alerts
|

Resequencing considerations in parallel downloads

Abstract: 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 mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
1

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(11 citation statements)
references
References 13 publications
0
10
1
Order By: Relevance
“…[19] [21], to model network bursty loss behavior. This bursty loss behavior has been shown to arise from the drop-tail queuing disciplines implemented in many Internet routers.…”
Section: Modeling Path Lossmentioning
confidence: 99%
“…[19] [21], to model network bursty loss behavior. This bursty loss behavior has been shown to arise from the drop-tail queuing disciplines implemented in many Internet routers.…”
Section: Modeling Path Lossmentioning
confidence: 99%
“…In Reference [6] the delay of the packets from each source was modelled and the resequencing buffer occupancy distribution when more than one server is used to download different parts of the same resource in parallel was analysed. Algorithms that assign each packet to a source responsible for its transmission, to achieve better performance were defined and analysed as well.…”
Section: Summary and Future Workmentioning
confidence: 99%
“…Denote the resequencing buffer occupancy upon the ith arrival by B i : It is not difficult to verify that the following equality holds (proofs for similar equalities can be found in Reference [6]) …”
Section: Appendix Bmentioning
confidence: 99%
“…Multipath transport was extended to the manv-to-one type of applications in [46]. An analytical model of parallel data downloading from multiple servers was presented to minimize the resequencing buffer size and total download time.…”
Section: Related Workmentioning
confidence: 99%