Journal article

On Channel Failures, File Fragmentation Policies, and Heavy-Tailed Completion Times

J Nair, M Andreasson, LLH Andrew, SH Low, JC Doyle

IEEE ACM Transactions on Networking | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2016

Abstract

It has been recently discovered that heavy-tailed completion times can result from protocol interaction even when file sizes are light-tailed. A key to this phenomenon is the use of a restart policy where if the file is interrupted before it is completed, it needs to restart from the beginning. In this paper, we show that fragmenting a file into pieces whose sizes are either bounded or independently chosen after each interruption guarantees light-tailed completion time as long as the file size is light-tailed; i.e., in this case, heavy-tailed completion time can only originate from heavy-tailed file sizes. If the file size is heavy-tailed, then the completion time is necessarily heavy-tailed..

View full abstract

University of Melbourne Researchers

Grants

Awarded by National Science Foundation


Funding Acknowledgements

This work was supported by the ARO under MURI Grant W911NF-08-1-0233, the NSF under the NetSE Grant, the Caltech Lee Center for Advanced Networking, and the Australian Research Council under Grant DP0985322. The work of J. Nair was supported in part by an NWO VIDI Grant. A shorter version of this paper appeared in the IEEE International Conference on Computer Communications (INFOCOM), San Diego, CA, USA, March 15-19, 2010. A preliminary version was also presented at the Workshop on MAthematical Performance Modeling and Analysis (MAMA), Seattle, WA, USA, June 15, 2009.