Ä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
On Channel Failures, File Fragmentation Policies, and Heavy-Tailed Completion Times
Indian Institute of Technology Bombay.
KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
Monash University. (Centre for Advanced Internet Architectures)
California Institute of Technology.
Visa övriga samt affilieringar
2014 (Engelska)Ingår i: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. PP, nr 99Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

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. 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 bounded above by that of the original file size stretched by a constant factor. We then prove that if the distribution of times between interruptions has nondecreasing 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. Both these policies are also shown to have desirable completion time tail behavior. 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 Press, 2014. Vol. PP, nr 99
Nationell ämneskategori
Reglerteknik
Forskningsämne
Elektro- och systemteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-164309DOI: 10.1109/TNET.2014.2375920ISI: 000370969300040Scopus ID: 2-s2.0-84962449239OAI: oai:DiVA.org:kth-164309DiVA, id: diva2:805447
Anmärkning

QC 20150420

Tillgänglig från: 2015-04-15 Skapad: 2015-04-15 Senast uppdaterad: 2017-12-04Bibliografiskt granskad

Open Access i DiVA

fulltext(2086 kB)91 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 2086 kBChecksumma SHA-512
8b181e83d13706cd2209b5e2fc6bda41249f2f0131eda3a6fb3025acb7d7e4ebba1cf1d60e26040a6eec312dc41ca258cffd847e65918204442700496a648deb
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopusIEEEXplore

Sök vidare i DiVA

Av författaren/redaktören
Andreasson, Martin
Av organisationen
ACCESS Linnaeus CentreReglerteknik
I samma tidskrift
IEEE/ACM Transactions on Networking
Reglerteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 91 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: 88 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