Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
File Fragmentation over an Unreliable Channel
Computer Science and Electrical Engineering, California Institute of Technology.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Automatic Control.
Swinburne University of Technology. (Centre for Advanced Internet Architectures)
Computer Science and Electrical Engineering, California Institute of Technology.
Show others and affiliations
2010 (English)In: Proceedings IEEE International Conference on Computer Communications, San Diego, March 2010, IEEE , 2010, 1-9 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
Communications Society, Distribution functions, Internet, Probability distribution, Protocols, Random variables, Robustness, Routing, Tail, USA Councils
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-47600DOI: 10.1109/INFCOM.2010.5461953Scopus ID: 2-s2.0-77953312128OAI: oai:DiVA.org:kth-47600DiVA: diva2:455729
Note
© 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 20111111Available from: 2011-11-11 Created: 2011-11-11 Last updated: 2011-11-11Bibliographically approved

Open Access in DiVA

Filefragmentation(174 kB)68 downloads
File information
File name FULLTEXT01.pdfFile size 174 kBChecksum SHA-512
8a7200b5f1dae8cc3a01eaa91f0434484cac18e76fe0080273de70f63e62f46cb8a794b329250ed1be3b1a57a5e0bd922276b46fdbf832f103a4130747977cfb
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusPublished version

Search in DiVA

By author/editor
Andreasson, Martin
By organisation
ACCESS Linnaeus CentreAutomatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 68 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 70 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf