File Fragmentation over an Unreliable Channel
2010 (English)In: Proceedings IEEE International Conference on Computer Communications, San Diego, March 2010, IEEE , 2010, 1-9 p.Conference paper (Refereed)
It has been recently discovered that heavy-tailed file completion time can result from protocol interaction even when file sizes are light-tailed. A key to this phenomenon is the RESTART feature where if a file transfer is interrupted before it is completed, the transfer needs to restart from the beginning. In this paper, we show that independent or bounded fragmentation produces light-tailed file completion time as long as the file size is light-tailed, i.e., in this case, heavy-tailed file completion time can only originate from heavy-tailed file sizes. If the file size is heavy-tailed, then the file completion time is clearly heavy-tailed. For this case, we show that when the file size distribution is regularly varying, then under independent or bounded fragmentation, the completion time tail distribution function is asymptotically upper bounded by that of the original file size stretched by a constant factor. We then prove that if the failure distribution has non-decreasing failure rate, the expected completion time is minimized by dividing the file into equal sized fragments; this optimal fragment size is unique but depends on the file size. We also present a simple blind fragmentation policy where the fragment sizes are constant and independent of the file size and prove that it is asymptotically optimal. Finally, we bound the error in expected completion time due to error in modeling of the failure process.
Place, publisher, year, edition, pages
IEEE , 2010. 1-9 p.
Communications Society, Distribution functions, Internet, Probability distribution, Protocols, Random variables, Robustness, Routing, Tail, USA Councils
IdentifiersURN: urn:nbn:se:kth:diva-47600DOI: 10.1109/INFCOM.2010.5461953ScopusID: 2-s2.0-77953312128OAI: oai:DiVA.org:kth-47600DiVA: diva2:455729
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201111112011-11-112011-11-112011-11-11Bibliographically approved