Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Effective erasure codes for reliable computer communication protocols
ACM SIGCOMM Computer Communication Review
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Dynamic parallel access to replicated content in the internet
IEEE/ACM Transactions on Networking (TON)
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SPAND: shared passive network performance discovery
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
International Journal of Communication Networks and Distributed Systems
Space optimal solution for data reordering in streaming applications on NoC based MPSoC
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. The schemes suggested in most proposed parallel download approaches focus on reducing the total download duration. For streaming applications a more crucial performance issue is the regularity of flow of data to the application. Burstiness in data arrival implies longer playback delays, a higher probability of interruption at the application and larger required memory space for resequencing, which is undesirable and may become prohibitive for mobile devices with limited resources. This paper formulates models for an approach based on receiving only one copy of each of the data blocks in a file, while different data blocks may be obtained from different sources. This approach allows more robust download rates even when the conditions for each server/path used may change rapidly. In the parallel download scenario, out-of-order arrivals at the receiving side are unavoidable. We present methods to keep out-of-order low to ensure a more regulated flow of data to the application. 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.