Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
File Fragmentation over an Unreliable Channel
Computer Science and Electrical Engineering, California Institute of Technology.
KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
Swinburne University of Technology. (Centre for Advanced Internet Architectures)
Computer Science and Electrical Engineering, California Institute of Technology.
Visa övriga samt affilieringar
2010 (Engelska)Ingår i: Proceedings IEEE International Conference on Computer Communications, San Diego, March 2010, IEEE , 2010, s. 1-9Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE , 2010. s. 1-9
Nyckelord [en]
Communications Society, Distribution functions, Internet, Probability distribution, Protocols, Random variables, Robustness, Routing, Tail, USA Councils
Nationell ämneskategori
Reglerteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-47600DOI: 10.1109/INFCOM.2010.5461953Scopus ID: 2-s2.0-77953312128OAI: oai:DiVA.org:kth-47600DiVA, id: diva2:455729
Anmärkning
© 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 20111111Tillgänglig från: 2011-11-11 Skapad: 2011-11-11 Senast uppdaterad: 2011-11-11Bibliografiskt granskad

Open Access i DiVA

Filefragmentation(174 kB)111 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 174 kBChecksumma SHA-512
8a7200b5f1dae8cc3a01eaa91f0434484cac18e76fe0080273de70f63e62f46cb8a794b329250ed1be3b1a57a5e0bd922276b46fdbf832f103a4130747977cfb
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopusPublished version

Sök vidare i DiVA

Av författaren/redaktören
Andreasson, Martin
Av organisationen
ACCESS Linnaeus CentreReglerteknik
Reglerteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 111 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 99 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf